GATE CSE
First time here? Checkout the FAQ!
x
0 votes
79 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 (1.5k points)   | 79 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 (49.7k 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 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

    3514 Points

  10. GateSet

    3336 Points

Monthly Topper: Rs. 500 gift card

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