2,698 views
1 votes
1 votes
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

1 Answer

–1 votes
–1 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.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
Pavan Kumar Munnam asked May 12, 2017
374 views
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
3 votes
3 votes
3 answers
3
Vicky rix asked Apr 7, 2017
1,405 views
A graph consists of only one vertex,which is isolated ..Is that graphA) a complete graph ???B) a clique???C) connected graph ???Please explain your answer ...
0 votes
0 votes
1 answer
4