GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
55 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 Veteran (11.5k points)   | 55 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 Boss (5.9k points)  

Related questions

0 votes
2 answers
2
asked by sh!va Veteran (26.7k points)   | 143 views


Top Users May 2017
  1. akash.dinkar12

    3154 Points

  2. pawan kumarln

    1636 Points

  3. sh!va

    1600 Points

  4. Arjun

    1360 Points

  5. Bikram

    1322 Points

  6. Devshree Dubey

    1262 Points

  7. Debashish Deka

    1132 Points

  8. Angkit

    1044 Points

  9. LeenSharma

    900 Points

  10. srestha

    710 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. Bikram

    408 Points

  2. pawan kumarln

    262 Points

  3. Ahwan

    236 Points

  4. Arnab Bhadra

    234 Points

  5. LeenSharma

    138 Points


22,772 questions
29,098 answers
65,132 comments
27,639 users