Q. In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
💬 Discuss
✅ Correct Answer: (A) true
Explanation: according to a handshaking lemma, in graphs, in which all vertices have an odd degree, the number of hamiltonian cycles through any fixed edge is always even.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey
according to a handshaking lemma, in graphs, in which all vertices have an odd degree, the number of hamiltonian cycles through any fixed edge is always even.

💬 Discussion

Related MCQs

Q. The PDA is called non-deterministic PDA when there are more than one out going edges from……… state

Q. Is Best First Search a searching algorithm used in graphs.

Q. What must be done to interface TTL to CMOS?

Q. COCOMO-II estimation model is based on

Q. Computers invariably use RAM for

Q. The paths from root node to the nodes labelled 'a' are called __________.

Q. Which phase is not available in software life cycle?

Q. A view shows the system hardware and how software components are distributed across the processors in the system.

Q. Let x.c be a C source code. The command cc x.c > y

Q. If a set is a frequent set and no superset of this set is a frequent set, then it is called ________.

📊 Question Analytics

👁️
336
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
82%
Success Rate