retagged by
2,116 views
0 votes
0 votes

Which of the following statements is/are TRUE?

$S1$:The existence of an Euler circuit implies that an Euler path exists.

$S2$:The existence of an Euler path implies that an Euler circuit exists. 

  1. $S1$ is true.
  2. $S2$ is true.
  3. $S1$ and $S2$ both are true.
  4. $S1$ and $S2$ both are false.
retagged by

1 Answer

2 votes
2 votes
An Euler circuit in a graph G is a simple circuit containing every edge of G exactly once
An Euler path in G is a simple path containing every edge of G exactly once.
An Euler path starts and ends at different vertices.
An Euler circuit starts and ends at the same vertex.

Euler path+ ends at the same vertex.= Euler circuit ,only s1 true

option A
Answer:

Related questions

0 votes
0 votes
1 answer
1
admin asked Mar 30, 2020
9,944 views
Given an undirected graph $G$ with $V$ vertices and $E$ edges, the sum of the degrees of all vertices is$E$$2E$$V$$2V$
0 votes
0 votes
1 answer
3
admin asked Mar 30, 2020
2,075 views
A path in graph $G$, which contains every vertex of $G$ and only once?Euler circuitHamiltonian pathEuler PathHamiltonian Circuit
0 votes
0 votes
1 answer
4
admin asked Mar 30, 2020
909 views
In a given following graph among the following sequences: abeghf abfehgabfhgeafghbe Which are depth first traversals of the above graph?I,II and IV onlyI and IV onlyII,II...