GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
95 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 (13.3k points)   | 95 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 Aug 2017
  1. Bikram

    5034 Points

  2. ABKUNDAN

    4730 Points

  3. akash.dinkar12

    3488 Points

  4. manu00x

    3296 Points

  5. rahul sharma 5

    3178 Points

  6. makhdoom ghaya

    2530 Points

  7. just_bhavana

    2428 Points

  8. stblue

    2240 Points

  9. Tesla!

    2076 Points

  10. joshi_nitish

    1830 Points


25,032 questions
32,178 answers
74,993 comments
30,218 users