Multiple Choice
A Hamiltonian cycle in a Hamiltonian graph of order 24 has
A) 12 edges.
B) 24 edges
C) 23 edges
D) None of above.
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q17: A spanning tree for a simple graph
Q18: If G is a simple connected 3-regular
Q19: The following grammar<br>G = (N, T, P,
Q20: Two strings x and y are indistinguishable
Q21: Which of the following is not a
Q23: The language accepted by a Push down
Q24: If G is "S ? a S/a",
Q25: The …………. is said to be ambiguous
Q26: Which of the following problems is undecidable?<br>A)Membership
Q27: The regular expression 0*(10)* denotes the same