424 views
2 votes
2 votes
if a graph contains 2 components,1st component contains only one  vertex and 2nd component is a cycle with 4 vertices. is this graph Eulerian?

it should be Eulerian ryt?

1 Answer

0 votes
0 votes
Yes no doubt it is eulerian. Because in d first component with a single vertex, the starting and end point are same for the cycle to take place. In a similar manner for d second component with four vertices, d starting and end point when traveresed are same then without word d whole graph is Eulerian. :)

Related questions

1 votes
1 votes
1 answer
1
Mk Utkarsh asked Aug 24, 2018
1,717 views
Find the number of connected Eulerian graphs with 6 unlabelled vertices.Draw each of them.Note: I'm looking for a fast procedure don't comment just the numerical answer.
0 votes
0 votes
0 answers
2
Lakshman Bhaiya asked Oct 21, 2018
1,547 views
How many Eulerian graphs are possible?
1 votes
1 votes
2 answers
4
sh!va asked Jul 9, 2016
907 views
The graph in the figure is a portion of the Shri Chakra.Is it :(1) a Planar graph ?(2) a Hamiltonian graph ?(3) an Eulerian graph ?(A) 1 and 2(B) 2 and 3(C) 1 and 3(D) 1,...