GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
52 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 (10.2k points)   | 52 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 Jan 2017
  1. Debashish Deka

    8322 Points

  2. sudsho

    5166 Points

  3. Habibkhan

    4718 Points

  4. Vijay Thakur

    4468 Points

  5. Bikram

    4420 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4072 Points

  8. santhoshdevulapally

    3732 Points

  9. Sushant Gokhale

    3518 Points

  10. GateSet

    3336 Points

Monthly Topper: Rs. 500 gift card

19,158 questions
24,065 answers
52,873 comments
20,288 users