Theorem: - Handshaking Lemma : Statement :- For any graph G with e edges and n vertices v1,v2,…………vn then ∑_(i=1)^n▒〖d(vi)=2e 〗 OR Show that the sum of the degree of all the vertices in a graph is even .

Theorem: - Handshaking Lemma : Statement :- For any graph G with e edges and n vertices v1,v2,…………vn then ∑_(i=1)^n▒〖d(vi)=2e 〗 OR Show that the sum of the degree of all the vertices in a graph is even .

January 08, 2020

B.Sc III [ Semester -VI ( Paper-XII) ]

Graph Theory

Theorem : Handshaking Lemma

Theorem: - Handshaking Lemma :- Statement :- For any graph G with e edges and n vertices v1,v2,…………vn then ∑_(i=1)^n▒〖d(vi)=2e 〗 OR Show that the sum of the degree of all the vertices in a graph is even .

Theorem: - Handshaking Lemma :- Statement :- For any graph G with e edges and n vertices v1,v2,…………vn then ∑_(i=1)^n▒〖d(vi)=2e 〗OR Show that the sum of the degree of all the vertices in a graph is even .

Comments