I'm taking a class in Discrete Mathematics, and one of the problems in my homework asks for a Simple Graph with 5 vertices of degrees 2, 3, 3, 3, and 5. How can I have more than 4 edges? I'm really confused, maybe I don't really understand what a "Simple Graph" means.
[Math] Simple Graph with 5 vertices of degrees 2, 3, 3, 3, 5
discrete mathematicsgraph theory
Related Question
- [Math] Prove that a simple graph with 17 vertices and 73 edges cannot be bipartite
- [Math] Suppose G is a connected planar simple graph with $e$ edges and $v$ vertices with no cycles of length 4 or less…
- [Math] Drawing a simple graph with six vertices and varying degrees
- [Math] Drawing a simple graph from known degrees
- [Math] Simple graph with 6 vertices and 11 edges
Best Answer
Since you only have 5 vertices, it is not possible in a simple graph to have a maximum degree of more than $5-1=4$. Hence, such a simple graph as required does not exist.