GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
163 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 | 163 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.3k 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 (271 points)  
Top Users Feb 2017
  1. Arjun

    5386 Points

  2. Bikram

    4230 Points

  3. Habibkhan

    3952 Points

  4. Aboveallplayer

    3086 Points

  5. Debashish Deka

    2564 Points

  6. sriv_shubham

    2318 Points

  7. Smriti012

    2236 Points

  8. Arnabi

    2008 Points

  9. mcjoshi

    1696 Points

  10. sh!va

    1684 Points

Monthly Topper: Rs. 500 gift card

20,863 questions
26,021 answers
59,689 comments
22,131 users