Register

GATE Overflow Test Series | Discrete Mathematics | Test 4 | Question: 20

• recategorized by
207 views

1 Answer

Best answer
3 votes
3 votes

A path which visits every vertex exactly once. Such path is called a Hamiltonian path.

$S_1:$


$S_2:$

 

Both have Hamiltonian paths.

So, the correct answer is $(C)$.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
gatecse asked Sep 14, 2020
284 views
GATE Overflow Test Series | Discrete Mathematics | Test 4 | Question: 21
The number of Hamiltonian cycles on the following graph is __________
The number of Hamiltonian cycles on the following graph is __________
User Avatar
1 votes
1 votes
1 answer
2
gatecse asked Sep 14, 2020
195 views
GATE Overflow Test Series | Discrete Mathematics | Test 4 | Question: 1
If $G$ is a simple graph with $16$ edges and $\overline{G}$ has $12$ edges, how many vertices does the complement graph $\overline{G}$ have?
If $G$ is a simple graph with $16$ edges and $\overline{G}$ has $12$ edges, how many vertices does the complement graph $\overline{G}$ have?
User Avatar
4 votes
4 votes
1 answer
3
gatecse asked Sep 14, 2020
326 views
GATE Overflow Test Series | Discrete Mathematics | Test 4 | Question: 3
The number of possible connected simple graphs with $3$ labelled vertices is ________
The number of possible connected simple graphs with $3$ labelled vertices is ________
User Avatar
Link Copied!