MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
Vertex Coloring Multiple Choice
→
General
→
How many edges will a tree consisting of N nodes h...
1.
How many edges will a tree consisting of N nodes have?
A.
Log(N)
B.
N
C.
N 1
D.
N + 1
Answer» D. N + 1
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Vertex coloring and chromatic number are one and the same.
Minimum number of colors required for proper edge coloring of a graph is called?
How many unique colors will be required for proper vertex coloring of a complete graph having n vertices?
How many unique colors will be required for proper vertex coloring of a line graph having n vertices?
Which of the following is an NP complete problem?
How many unique colors will be required for proper vertex coloring of a bipartite graph having n vertices?
How many unique colors will be required for proper vertex coloring of an empty graph having n vertices?
Minimum number of unique colors required for vertex coloring of a graph is called?
How many edges will a tree consisting of N nodes have?
What is vertex coloring of a graph?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies
