Graph TheoryCut Vertices & Edges (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 1  1 of 1
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: 1
» Graph Theory » Cut Vertices & Edges
MCQ▾
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 
