The following graph has 45 vertices

Mathematics
Tutor: None Selected Time limit: 1 Day

May 11th, 2015

The sum of degrees is 4 * BLANK = BLANK so the number of edges is BLANK by theorem 2.6

 every vertex has degree 4, so each vertex "owns" half each of 4 different edges.

The Handshaking Theorem gives the precise relation between the number of edges in a graph and the sum of the degree of the vertices of a graph. If you know the degree of each vertex, then, you know the sum of the degrees in the graph, and hence the number of edges.

_____________________________________________________________________________________

May 11th, 2015

Studypool's Notebank makes it easy to buy and sell old notes, study guides, reviews, etc.
Click to visit
The Notebank
...
May 11th, 2015
...
May 11th, 2015
Dec 9th, 2016
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer