ISRO CS-2023
August 29, 2024ISRO CS-2023
August 29, 2024ISRO CS-2023
|
Question 51
|
Which of the following are true?
(i)In a graph G with ‘n’ vertices and ‘e’ edges, sum of degrees of vertices =2*e
(ii)Eccentricity of a connected graph can never be equal to radius of the graph
(iii)Girth of a graph is the total number of edges in the shortest cycle of the graph
(iv)Graph with equal degree for all vertices is multigraph
(i)In a graph G with ‘n’ vertices and ‘e’ edges, sum of degrees of vertices =2*e
(ii)Eccentricity of a connected graph can never be equal to radius of the graph
(iii)Girth of a graph is the total number of edges in the shortest cycle of the graph
(iv)Graph with equal degree for all vertices is multigraph
|
(i), (ii), (iii)
|
|
|
(ii), (iii), (iv)
|
|
|
(i), (iii), (iv)
|
|
|
None of the above
|
Correct Answer: D