Show that, in any finite graph with at least two vertices, there must be two vertices with the same degree.
HINTS ONLY!
[Math] In any finite graph with at least two vertices, there must be two vertices with the same degree
graph theory
graph theory
Show that, in any finite graph with at least two vertices, there must be two vertices with the same degree.
HINTS ONLY!
Best Answer
Hint: Suppose the graph has $n$ vertices. Which integers can be the degree of a vertex?