Duplicate Question
The question on this page has been marked as a duplicate question.
Original Question
Prove that a simple graph with n >_ 2 vertices must have atleast two vertices with the same degree. There was a hint given in t...Asked by Matt
Prove that a simple graph with n >_ 2 vertices must have atleast two vertices with the same degree. There was a hint given in the book saying that the key to this is the graph can not have both a vertex of 0 degree and a vertex of n-1 degree
Answers
Answered by
Jeff
Im really unsure about this question i have not been taught this type of graphing before. It is a tough one.
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.