Question:-
84. If an undirected graph has Hamiltonian cycle then it is definitely :
Option (A)
tree
Option (B)
clique
Option(C)
Bi-connected
Option(D)
Tri-connected
Correct Option:
()
question-answer-faq-2483