• recategorized by
3,593 views
0 0 votes
Is it possible that a disconnected graph be an Euler graph ?

3 Answers

1 1 vote

disconnected graph can have an Euler circuit. That's because an Euler circuit is only required to traverse every edge of the graph, it's not required to visit every vertex; so isolated vertices are not a problem. A graph is connected enough for an Euler circuit if all the edges belong to one and the same component

0 0 votes
No, as the basic definition of Euler graph is standardized to only Connected Graphs.
Position:
Show:

Related questions

2 2 votes
2 2 answers
2.4k
2.4k views
thor asked Dec 28, 2016
2,409 views
2 2 votes
2 2 answers
5.8k
5.8k views
dan31 asked Nov 6, 2018
5,820 views
Consider the given statementsS1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G.S2:In a simple graph G, if degree of e...
7 7 votes
2 answers 2 answers
1.6k
1.6k views
Rahul Jain25 asked Oct 10, 2016
1,611 views
Consider the following statements$S1:2,3,3,3,3,3,4$ is a graphic sequence$S2:$ A connected graph with $10$ vertices and $16$ edges without having a cycle of length $3$, i...
0 0 votes
1 1 answer
1.0k
1.0k views
Shadan Karim asked Dec 21, 2018
1,015 views
Is this graph Euler?