Question 17254 – NTA UGC NET JUNE 2023 Paper-1
January 3, 2024Question 8416 – Transactions
January 4, 2024Question 342 – ISRO CS 2009
If G is a graph with e edges and n vertices, the sum of the degrees of all vertices in G is
Correct Answer: D
Question 1 Explanation:
Handshaking theorem states that the sum of degrees of the vertices of a graph is twice the number of edges.
If G=(V,E) be a graph with E edges,then-
Σ degG(V) = 2E
This theorem applies even if multiple edges and loops are present.
Since the given graph is undirected, every edge contributes as twice in sum of degrees. So the sum of degrees is 2e.
e
e/2
e2
2 e
Subscribe
Login
0 Comments