+1 vote
252 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.
edited | 252 views
Not every Euler/Unicursal graph is connected.and not every graph with even degree is Eulerian graph.

+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..
@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.