COUNTING HAMILTONIAN CYCLES ON PLANAR RANDOM LATTICES

Abstract

A Hamiltonian cycle of a graph is a closed path if it passs through each of the vertices once and only once. In this letter, Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles is obtained and its singularity is studied. Its relation with two-dimensional quantum gravity is discussed.