GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
40 views
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?
asked in Mathematical Logic by Boss (9.4k points)   | 40 views

yes it's eulerian as we just need to traverse all edges in graph and here all edges are nothing but edges in 2nd component having C4.

1 Answer

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. :)
answered by Loyal (2.5k points)  

Related questions

0 votes
2 answers
2
asked by sh!va Veteran (18.2k points)   | 81 views
Top Users Jan 2017
  1. Debashish Deka

    7090 Points

  2. Habibkhan

    4676 Points

  3. Vijay Thakur

    4224 Points

  4. saurabh rai

    4014 Points

  5. sudsho

    3982 Points

  6. Arjun

    3138 Points

  7. GateSet

    3088 Points

  8. santhoshdevulapally

    3004 Points

  9. Bikram

    2976 Points

  10. Sushant Gokhale

    2824 Points

Monthly Topper: Rs. 500 gift card

18,816 questions
23,786 answers
51,458 comments
20,133 users