Graph Theory (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 9  11 of 11
Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exampattern and syllabus changes. View Sample Explanation or View Features.
Rs. 450.00 or
Question number: 9
» Graph Theory » Connectivity
Question
The number of edges in a complete graph of n vertices is
Choices
Choice (4)  Response  

a.  n2/n 

b.  n 

c.  b > n (n1) /2 

d.  All of the above 

Question number: 10
» Graph Theory » Independent Sets
Question
The number of functions from an m element set to an n element set is
Choices
Choice (4)  Response  

a.  Mom 

b.  N^k 

c.  M * n 

d.  M + n 

Question number: 11
» Graph Theory » Cut Vertices & Edges
Question
Maximum number of edges in a nnode undirected graph without self loop
Choices
Choice (4)  Response  

a.  N^2 

b.  N (n1) /2 

c.  n1 

d.  All of the above 
