First time here? Checkout the FAQ!
+1 vote
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 (14.8k points) 15 152 318 | 125 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.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23678 Points

  2. Bikram

    17278 Points

  3. Habibkhan

    8962 Points

  4. srestha

    6460 Points

  5. Debashish Deka

    5478 Points

  6. jothee

    5128 Points

  7. Sachin Mittal 1

    4892 Points

  8. joshi_nitish

    4486 Points

  9. sushmita

    4052 Points

  10. Rishi yadav

    3974 Points

Recent Badges

Popular Question makhdoom ghaya
Great Question makhdoom ghaya
Famous Question makhdoom ghaya
Notable Question PriDix
Popular Question ManojK
Reader Chandramani Adil
Regular qwerty007
Notable Question rishu_darkshadow
Popular Question Rishi yadav
Popular Question makhdoom ghaya
27,417 questions
35,262 answers
33,497 users