GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
184 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.7k points)  
edited by | 184 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 (23.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 (389 points)  


Top Users Jul 2017
  1. Bikram

    4894 Points

  2. manu00x

    2888 Points

  3. Debashish Deka

    1870 Points

  4. joshi_nitish

    1776 Points

  5. Arjun

    1496 Points

  6. Hemant Parihar

    1306 Points

  7. Shubhanshu

    1128 Points

  8. Arnab Bhadra

    1114 Points

  9. pawan kumarln

    1114 Points

  10. Ahwan

    940 Points


24,089 questions
31,062 answers
70,677 comments
29,400 users