ExamCompetition Your Success, Our Mission
Login Register
Question discussion

A cycle in a graph that passes through every vertex exactly once and returns to its starting vertex is called a

2553Medium DSSSB TGT Computer Science 0 replies

A cycle in a graph that passes through every vertex exactly once and returns to its starting vertex is called a

  • AEuler circuit
  • BHamiltonian cycle
  • Cspanning tree
  • Dminimum cut
Correct answer: B

Explanation

A Hamiltonian cycle visits every vertex exactly once, whereas an Euler circuit uses every edge exactly once.
Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!