hamiltonian cycle

/HH AE1 M AH0 L T OW1 N IY0 AH0 N S AY0 K AH0 L/
noun
  1. 1

    (graph theory) A Hamiltonian path with an additional connection between the first and last vertices visited, forming a cycle.