GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
173 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 | 173 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.4k 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 Apr 2017
  1. akash.dinkar12

    3660 Points

  2. Divya Bharti

    2580 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Debashish Deka

    1614 Points

  7. Shubham Sharma 2

    1610 Points

  8. Prashant.

    1492 Points

  9. Arunav Khare

    1464 Points

  10. Arjun

    1464 Points

Monthly Topper: Rs. 500 gift card

22,086 questions
28,062 answers
63,294 comments
24,160 users