edited by
9,006 views
11 votes
11 votes

A given connected graph $\text{G}$ is a Euler Graph if and only if all vertices of $\text{G}$ are of

  1. same degree                              
  2. even degree
  3. odd degree                                  
  4. different  degree
edited by

4 Answers

Best answer
7 votes
7 votes

A given connected graph G is a Euler Graph if and only if all vertices of G are of even degree.

So option B is correct.

selected by
8 votes
8 votes

ans is B an euler graph is a graph having an euler circuit 

An Eulerian cycle,[3] Eulerian circuit or Euler tour in an undirected graph is a cycle that uses each edge exactly once. If such a cycle exists, the graph is called Eulerian orunicursal. following graph is euler with even degree of every vertex

0 votes
0 votes
A given connected graph Gis a Euler Graph if and only if all vertices of G are of even degree.
so option B. is correct answer
Answer: