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 (12.3k points)   | 81 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 Mar 2017
  1. rude

    4018 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2606 Points

  5. Debashish Deka

    2088 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1312 Points

  8. Bikram

    1218 Points

  9. Akriti sood

    1166 Points

  10. Sanjay Sharma

    984 Points

Monthly Topper: Rs. 500 gift card

21,438 questions
26,753 answers
22,926 users