Scribd
Upload
703 views8 pages

Handshaking Theorm

The document discusses the Handshaking Theorem in graph theory, which states that the sum of the degrees of all vertices in a graph is equal to twice the number of edges. It provides two example problems that demonstrate how to use the Handshaking Theorem to calculate the number of vertices or number of vertices of a certain degree, given other information about the graph such as the number of edges or number of vertices of certain degrees.

Uploaded by

Muhammad Abdullah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
703 views8 pages

Handshaking Theorm

The document discusses the Handshaking Theorem in graph theory, which states that the sum of the degrees of all vertices in a graph is equal to twice the number of edges. It provides two example problems that demonstrate how to use the Handshaking Theorem to calculate the number of vertices or number of vertices of a certain degree, given other information about the graph such as the number of edges or number of vertices of certain degrees.

Uploaded by

Muhammad Abdullah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Fundamental Theorem of Graph

Theory
(Handshaking Theorem)
MADE BY:
SARAH MEHMOOD (311)
RABEED SHAHID (316)
Handshaking Theorem
 In Graph Theory , Handshaking Theorem states in any
given graph,
“Sum of degree of all the vertices is twice
the number of edges contained in it.”

 HandshakingTheorem is also known as Handshaking


Lemma or Sum of Degree Theorem.
Conclusions

The following conclusions may be drawn from the Handshaking Theorem.


In any graph,

 The sum of degree of all the vertices is always even.

 The sum of degree of all the vertices with odd degree is always even.

 The number of vertices with odd degree are always even.


Problem 1
A simple graph G has 24 edges and degree of each vertex is 4. Find the
number of vertices.
 
Solution-
 
Given-
Number of edges = 24
Degree of each vertex = 4
 
Let number of vertices in the graph = n. 
Continue
Using Handshaking Theorem, we have-
Sum of degree of all vertices = 2 x Number of edges

Substituting the values, we get-


n x 4 = 2 x 24
n=2x6
∴ n = 12
 
Thus, Number of vertices in the graph = 12.
Problem 2
A simple graph contains 35 edges, four vertices of degree 5, five
vertices of degree 4 and four vertices of degree 3. Find the number
of vertices with degree 2.
Solution-
 
Given-
Number of edges = 35
Number of degree 5 vertices = 4
Number of degree 4 vertices = 5A s
Number of degree 3 vertices = 4
 
Let number of degree 2 vertices in the graph = n.
Continue
Using Handshaking Theorem, we have-
Sum of degree of all vertices = 2 x Number of edges
 
Substituting the values, we get-
4 x 5 + 5 x 4 + 4 x 3 + n x 2 = 2 x 35
20 + 20 + 12 + 2n = 70
52 + 2n = 70
2n = 70 – 52
2n = 18
∴n=9
 
Thus, Number of degree 2 vertices in the graph = 9.
THANK YOU 

You might also like