First time here? Checkout the FAQ!
+1 vote
Which of the following statements is/are TRUE?
[P] Every disconnected graph has an isolated vertex
[Q] A graph is connected if and only if some vertex is connected to all other vertices
[R] The edge set of every closed trail can be partitioned into edge sets of cycles
[S] If a maximal trail in a graph is not closed, then its endpoints have odd degree
asked in Graph Theory by Veteran (11.1k points)   | 76 views
i know about points 1 and 2,please tell about points 3 and 4th.

not understanding them at all.

Please log in or register to answer this question.

Top Users Feb 2017
  1. Arjun

    5234 Points

  2. Bikram

    4230 Points

  3. Habibkhan

    3828 Points

  4. Aboveallplayer

    3006 Points

  5. Debashish Deka

    2378 Points

  6. sriv_shubham

    2308 Points

  7. Smriti012

    2148 Points

  8. Arnabi

    2008 Points

  9. sh!va

    1672 Points

  10. mcjoshi

    1628 Points

Monthly Topper: Rs. 500 gift card

20,841 questions
26,000 answers
22,073 users