GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
169 views
consider the following statement-:

1.If a graph has Euler circuit then it is Strongly Connected graph.

2.If a graph has Euler path(but not Euler circuit) then it is Strongly Connected graph.

3.If a graph has Euler circuit then it is Weakly Connected graph.

4.If a graph has Euler path(but not euler circuit) then it is Weakly Connected graph.

Which statement is true with proper explanation.
asked in Graph Theory by Boss (8.1k points)  
edited by | 169 views

2 Answers

+1 vote
1. Should be ans...

Euler path visit each edge exactly once...

And in that if starting vertex and ending vertex is same than called circuit..

Euler circuitgenerates cycle of n-1 edges ...

And it is maximal connected component..
answered by Veteran (22.1k points)  
@Gabbar If a graph is having a isolated vertex and a cycle .than it is having euler cycle but it is not strongly connected .
and i this scenario all options are wrong beacuse we can find the contradictory example for each case.
0 votes
Answer is 1 because:

if there is an euler circuit in the graph then that means there exists a closed path that traverses all the edges of the graph exactly once. This means every vertex is reachable from every other vertex. Hence Strongly connected.
answered by (275 points)  


Top Users Mar 2017
  1. rude

    4768 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2734 Points

  5. Debashish Deka

    2592 Points

  6. 2018

    1544 Points

  7. Vignesh Sekar

    1422 Points

  8. Akriti sood

    1342 Points

  9. Bikram

    1312 Points

  10. Sanjay Sharma

    1126 Points

Monthly Topper: Rs. 500 gift card

21,508 questions
26,832 answers
61,091 comments
23,146 users