in Graph Theory retagged by
2,076 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.
in Graph Theory retagged by
by
2.1k views

1 comment

A connected multigraph has an Euler path but not an Euler circuit if and only if it has exactly two vertices of odd degree
1
1

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

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true