First time here? Checkout the FAQ!
+1 vote
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 Loyal (4.6k points)  

Related questions

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

Top Users Apr 2017
  1. akash.dinkar12

    3660 Points

  2. Divya Bharti

    2576 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Debashish Deka

    1614 Points

  7. Shubham Sharma 2

    1610 Points

  8. Arunav Khare

    1464 Points

  9. Arjun

    1440 Points

  10. Kapil

    1426 Points

Monthly Topper: Rs. 500 gift card

22,084 questions
28,059 answers
24,158 users