Let G be a graph in which every vertex has degree 2. Is G necessarily a cycle?
Printable View
Let G be a graph in which every vertex has degree 2. Is G necessarily a cycle?
You know that twice the number of edges equals the degree sum.Quote:
Originally Posted by dynas7y
Does this mean that the number of edges is the number of edges?
So what is the conclusion?
What do you mean by is the number of edges the number of edges? Using the theorem to find the number of edges the number of edges would be 2n/2, where n is the number of vertices. So if n is odd then there are an odd number of edges and if n is even there are an even number of edges...
If a simple graph has n vertices,Quote:
Originally Posted by dynas7y
is the number of edges, and
is the degree of vertex
then.
That is a most basic idea in graph theory.
I understand the theorem, which is what I explained in my post regarding the sum of the degrees and the number of edges. By the theorem, since each vertex has degree 2, then the number of vertices multiplied by 2 gives the sum of the degrees. Divide this by two gives you the number of edges. I'm not sure how this relates to the original question though of whether a graph with all of it's vertices having degree 2 is necessarily a cycle
I must say that I do not think that understands the implication of this material.Quote:
Originally Posted by dynas7y
Every vertex has two concurrent edges.
There are no other possibilities.