edited by
3,592 views
4 votes
4 votes

Given the following graphs :

      

    

   $(G_{1})$                                    $(G_{2})$

Which of the following is correct ?

  1. $G_{1}$ contains Euler circuit and  $(G_{2})$ does not contain Euler circuit.
  2. $(G_{1})$  does not contain Euler circuit and   $(G_{2})$ contains Euler circuit.
  3. Both $(G_{1})$  and   $(G_{2})$ do not contain Euler circuit.
  4. Both $(G_{1})$  and   $(G_{2})$ contain Euler circuit.
edited by

1 Answer

0 votes
0 votes
For a graph to be euler graph every vertex in the graph should have have even degree in graph G1 all the  vertices have  odd degree  so no euler circuit possible therfore g1 is not euler graph.

Graph G2 has vertex a ,d,e all these vertex have odd degree as 3 ,5,3 so here no euler ciruit possible .no this graph is also not euler graph .

So (c) option ans.
Answer:

Related questions

2 votes
2 votes
1 answer
2
makhdoom ghaya asked Sep 5, 2016
7,508 views
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices areAll of even degreeAll of odd degreeOf any degreeEven in number
2 votes
2 votes
1 answer
4
makhdoom ghaya asked Sep 28, 2016
2,795 views
In Data mining, ______ is a method of incremental conceptual clustering.STRINGCOBWEBCORBAOLAD