Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

hamiltonian cycle

GATE CSE & IT · Graph Theory · 2006-2019

2
PYQs
100%
keyed
0
elite explanations
2
years appeared

Study anchor

Rosen — Discrete Mathematics and Its Applications

Discrete structures, counting, relations, graph theory

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2019 PYQ

Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to

easyanswer keybasic explanation
2006 PYQ

Let SHAM 3 be the problem of finding a Hamiltonian cycle in a graph G = (V, E) with |V| divisible by 3 and DHAM 3 be the problem of determining if a Hamiltonian cycle exists in suc...

mediumanswer key