390 views
0 votes
0 votes
Which of the following statements are false?

a) A closed path of length n has distinct vertices and n distinct edges.

b) A circuit may have repeated vertices other than its end points

c) 2 paths are vertex disjoint if they do not share a common vertex

A) c only B) a only C) a) and c) d) None

Ans is none....but as per me a) is F as closed path don't have distinct vertices (initial and final vertices are same).....

1 Answer

1 votes
1 votes
"has distinct vertices" I guess number of distinct vertices or "all distinct" should be mentioned here,

Related questions

0 votes
0 votes
0 answers
1
Malusi asked Jan 12
88 views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...
0 votes
0 votes
3 answers
3
Bongbirdie asked Apr 1, 2017
623 views
What is the difference between path and Euler path?
4 votes
4 votes
2 answers
4
Jason GATE asked Jan 31, 2017
1,905 views
Which of the following Graph has Euler Path but is not an Euler Graph?A. K1,1 B.K2,10 C.K2,11D.K10,11.