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 (12.5k points) 12 52 155 | 62 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 (7.1k points) 3 22 52

Related questions

0 votes
2 answers
asked by sh!va Veteran (30.2k points) 108 371 691 | 165 views
+2 votes
2 answers

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23346 Points

  2. Bikram

    17058 Points

  3. Habibkhan

    8142 Points

  4. srestha

    6254 Points

  5. Debashish Deka

    5438 Points

  6. jothee

    4968 Points

  7. Sachin Mittal 1

    4772 Points

  8. joshi_nitish

    4298 Points

  9. sushmita

    3964 Points

  10. Rishi yadav

    3794 Points

Recent Badges

100 Club Vamp thehacker
Popular Question LavTheRawkstar
Notable Question shubham vashishtha
Nice Answer Habibkhan
Good Question jenny101
Regular Ashish Subscription
Famous Question Akash Kanase
Photogenic guptasaurabh9868
Nice Question Nishant Arora
Notable Question gabbar
27,301 questions
35,153 answers
33,244 users