Theorems in Graph Theory | Handshaking Theorem | Other Important Theorems

Theorems in Graph Theory | Handshaking Theorem | Other Important Theorems
In This Video we will discuss
1. Handshaking Theorem - The sum of degrees of all vertices in a graph G is equal to twice the number of edges in G.
2. Prove that in a graph the number of vertices of odd degree is even.
3. Prove that the maximum degree of any vertex in a simple graph having n vertices in n-1
4. Show that the maximum number of edges in a simple graph with n vertices is n(n-1)/2
5. Prove that the number of edges in a complete graph with n vertices is
n(n-1)/2
This video is helpful for
b.sc, bca, bba & Engineering mathematics.
Graph theory full playlist link
• Graph Theory discrete ...
Discrete Mathematics full playlist
• Analysis of Algorithm
Like the video
Share with your friends
and Subscribe
#graphtheroy #discretemathematics #bsc #btech #bca
0:00 Handshaking Theorem - The sum of degrees of all vertices in a graph G is equal to twice the number of edges in G.
3:45 Prove that in a graph the number of vertices of odd degree is even.
7:37 Prove that the maximum degree of any vertex in a simple graph having n vertices in n-1
9:23 Show that the maximum number of edges in a simple graph with n vertices is n(n-1)/2
11:44 Prove that the number of edges in a complete graph with n vertices is n(n-1)/2

[@deepikakatre3689]

Thankyou so much sir

[@gurmeetkhan5208]

Deserve more respect than gajendra😊

[@Currentlyunknownhuman]

Agree...mujhe bhi unka zyada smjh nhi ata...

[@SudeshKumar-jz2xd]

Thank you so much sir, you are life savior for all those students who did not get the concept in class.
I have watched so many of your videos,
Now i am addicted to know more and more about discrete mathematics.
❤❤

[@ganitya101]

😇😇

[@harshbudhlani5638]

Thanks sir it was helpful ❤

[@user-rr4ro2mx3v]

Thanks sir very nice explanation

[@SonaliNaik-wo6rv]

Thank you Sir😊

[@ganitya101]

th-cam.com/play/PL15h-I4HvELIhCh5VwKcvh9BQFFRnAFJr.html&si=GX9QZkmzYKAUj5vw
Or link in description