I'm doing a question in my text that asks me to find how many regions a graph has if it has 6 vertices all of which has degree 4. I know i'm supposed to use the euler theorem of $r=e-v+2$, but to use this I need to find the number of edges first. So how do I find the number of edges in a graph if I know how many vertices there are and their degrees?
Finding number of edges given vertices and degree sequence?
2
$\begingroup$
graph-theory
-
0See [Handshaking Lemma](https://en.wikipedia.org/wiki/Handshaking_lemma) and the degree sum formula (naming of these varies among authors). – 2017-02-16
-
1Note that the notion "regions a graph has" is meaningful only for planar graphs. – 2017-02-16
1 Answers
4
The sum of the vertex degree values is twice the number of edges, because each of the edges has been counted from both ends.
In your case $6$ vertices of degree $4$ mean there are $(6\times 4) / 2 = 12$ edges.
-
0...and without giving too much away, there is only one simple graph that has $6$ vertices all of degree $4$, and it corresponds to one of the regular polyhedra. – 2017-02-15