42. 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
- (A)
(i), (ii), (iii)
- (B)
(ii), (iii), (iv)
- (C)
(i), (iii), (iv)
- (D)
None of the above
