Graph Theory-Cut Vertices & Edges (GATE 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 exam-pattern 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 n-node undirected graph without self loop

Choices

Choice (4) Response

a.

N^2

b.

N (n-1) /2

c.

n-1

d.

All of the above

Sign In