Question

in any undirected graph the sum of degrees of all the nodes ​

Answer 1

Answer:

The Handshaking Lemma says that in an undirected graph the sum of the degrees of all nodes is exactly two times the sum of the edges. In contrast, in a directed graph the sum of all in-degrees is always equal to the sum of all out-degrees, and both sums are equal to the number of edges.

Answer 2

Given: an edge list of a graph we need to track down the amount of level of all hubs of an undirected chart.

To find: sum of degrees of all the nodes ​

Solution:

For an undirected diagram,  

Amount of degree in a diagram = dsum  

Number of edges in a chart = e  

Equation:  

By handshaking lemma:  

dsum = 2 × e  

Conclusion:  

• on the off chance that e is even  

dsum = 2 × even = even  

• on the off chance that e is odd  

dsum = 2 × odd = even  

In an undirected diagram, assuming we add the levels of all vertices, it is even.

The Handshaking Lemma says that in an undirected diagram the amount of the levels of all hubs are by and large twice the amount of the edges.

• Conversely, in a coordinated chart the amount of all in-degrees is equivalent 100% of the time to the amount of hard and fast degrees, and the two aggregates are equivalent to the number of edges.