Register

NIELIT 2017 July Scientist B (IT) - Section B: 1

Redirected
• retagged by
9,943 views

1 Answer

2 votes
2 votes

Handshaking Theorem

Handshaking Theorem is also known as Handshaking Lemma or Sum of Degree Theorem.

In Graph Theory, Handshaking Theorem states in any given graph, Sum of the degree of all the vertices is twice the number of edges contained in it.

{\displaystyle \sum _{v\in V}\deg v=2|E|}

 

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
admin asked Mar 30, 2020
2,075 views
NIELIT 2017 July Scientist B (IT) - Section B: 3
A path in graph $G$, which contains every vertex of $G$ and only once? Euler circuit Hamiltonian path Euler Path Hamiltonian Circuit
A path in graph $G$, which contains every vertex of $G$ and only once?Euler circuitHamiltonian pathEuler PathHamiltonian Circuit
User Avatar
0 votes
0 votes
1 answer
3
admin asked Mar 30, 2020
908 views
NIELIT 2017 July Scientist B (IT) - Section B: 5
In a given following graph among the following sequences: abeghf abfehg abfhge afghbe Which are depth first traversals of the above graph? I,II and IV only I and IV only II,III and IV only I,III and IV only
In a given following graph among the following sequences: abeghf abfehgabfhgeafghbe Which are depth first traversals of the above graph?I,II and IV onlyI and IV onlyII,II...
User Avatar
1 votes
1 votes
1 answer
4
admin asked Mar 30, 2020
972 views
NIELIT 2017 July Scientist B (IT) - Section B: 6
Considering the following graph, which one of the following set of edges represents all the bridges of the given graph? $(a,b), (e,f)$ $(a,b), (a,c)$ $(c,d), (d,h)$ $(a,b)$
Considering the following graph, which one of the following set of edges represents all the bridges of the given graph?$(a,b), (e,f)$$(a,b), (a,c)$$(c,d), (d,h)$$(a,b)$
User Avatar
Link Copied!