6,930 views
2 votes
2 votes
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?

1 Answer

1 votes
1 votes
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 votes
1 votes
2 answers
1
shivani2010 asked Jun 12, 2016
4,456 views
An undirected graph G has n vertices and n-1 edges then G isA. CyclicB. Addition of edge will make it cyclicC. EulerianD. Is a Tree
2 votes
2 votes
2 answers
3
shivani2010 asked Jun 12, 2016
4,325 views
An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes isA. Same degreeB. ODD degreeC. Need not be ODDD. ...