# An undirected graph has an even number of vertices of odd degree.

2k views
What does it means ?

An undirected graph has an even number of vertices of odd degree.

But let a 4 vertex cycle graph if it not complete having even vertex and even degree each vertex .Is it rt?
0
yes right.because you have 0 (even)number of vertices of odd degree.
0
I think here odd means different rather than does not divide by  2 .

1 vote
1) Vertices of even degree can be Even or Odd in number.

2) Vertices of odd degree have to be even in number.

So there is nothing wrong with a cyclic graph of 4 vertices.

## Related questions

1 vote
1
1.2k views
An undirected graph G has n vertices and n-1 edges then G is A. Cyclic B. Addition of edge will make it cyclic C. Eulerian D. Is a Tree
For this proof ,proving $\Rightarrow$ If Graph $G$ is eulerian then degree of each vertex is even with atmost one trivial component. As $G$ is Eulerian ,it means it **must not** repeat Edges but can repeat vertices.Now for the Eulerian (path) traversal ,we pass through that ... $C,F =3$ contradictory.... help me out where i am wrong
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\large \frac{1}{2}$. What is the probability that graph contains exactly 2 cycles of length 3?