GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
83 views
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.9k points)   | 83 views
i know about points 1 and 2,please tell about points 3 and 4th.

not understanding them at all.

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please log in or register.


Top Users May 2017
  1. Prashant.

    130 Points

  2. akankshadewangan24

    102 Points

  3. Tesla!

    90 Points

  4. Vishal Goel

    20 Points

  5. sh!va

    20 Points

  6. Arjun

    14 Points

  7. Krunal2016

    12 Points

  8. Raushank2

    10 Points

  9. Habibkhan

    10 Points

  10. akash.dinkar12

    10 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 01 - 07
  1. Prashant.

    130 Points

  2. akankshadewangan24

    102 Points

  3. Tesla!

    90 Points

  4. Vishal Goel

    20 Points

  5. sh!va

    20 Points


22,195 questions
28,249 answers
63,695 comments
24,385 users