Engineering-Mathematics
February 2, 2024Graph-Theory
February 2, 2024GATE 1995
|
Question 25
|
The minimum number of edges in a connected cyclic graph on n vertices is:
|
n – 1
|
|
|
n
|
|
|
n + 1
|
|
|
None of the above
|
Question 25 Explanation:
In a normal graph number of edges required for n vertices is n-1, and in cyclic graph it is n.
In cyclic graph:
No. of edges = No. of vertices
⇒ n = n
In cyclic graph:
No. of edges = No. of vertices
⇒ n = n
Correct Answer: B
Question 25 Explanation:
In a normal graph number of edges required for n vertices is n-1, and in cyclic graph it is n.
In cyclic graph:
No. of edges = No. of vertices
⇒ n = n
In cyclic graph:
No. of edges = No. of vertices
⇒ n = n