GATE CSE
First time here? Checkout the FAQ!
x
0 votes
131 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 Active (2.1k points)   | 131 views

1 Answer

0 votes
P)False. Disconnected means not connected. There may or may not be isolated vertex.

Q)False. In a cycle no vertex connected to all other vertices.

R)False. Partition are disjoint subset of a set. That may or may not a cycle.

S)True.If Trail or Walk is not closed, endpoint must contain some odd degree.
answered by Veteran (56.4k points)  
Q) is not true. It is only true for complete graph.

R)is not true. U cannot consider only a perticular graph. General case u have to assume.

If u are confirmed with ur answer give me some pic what u want to tell

i din't get the solution

 

any conclusion?
Even S isnt true. Take a cycle graph with 4 vertices i.e. square ABCD and connect BD. Now, trace the max trail as ABCDB but A doesnt have odd degree.


Top Users Aug 2017
  1. ABKUNDAN

    4654 Points

  2. Bikram

    4032 Points

  3. akash.dinkar12

    3136 Points

  4. rahul sharma 5

    2848 Points

  5. manu00x

    2664 Points

  6. makhdoom ghaya

    2380 Points

  7. just_bhavana

    2040 Points

  8. Tesla!

    1756 Points

  9. pawan kumarln

    1574 Points

  10. learner_geek

    1558 Points


24,876 questions
31,951 answers
74,099 comments
30,065 users