Counting Hamiltonian cycles on planar random lattices

Details Counting Hamiltonian cycles on planar random lattices Counting Hamiltonian cycles on planar random lattices

1998-01-29

arxiv.org/abs/cond-mat/9801307v2

Mod.Phys.Lett. A13 (1998) 727-734

Physics

Condensed Matter

Statistical Mechanics

8 pages, 3 figures, uses latex2e and graphicx, typos corrected and a reference added. Presentation improved

Scientific paper

10.1142/S0217732398000784

A Hamiltonian cycle of a graph is a closed path which visits each of the
vertices once and only once. In this article, Hamiltonian cycles on planar
random lattices are considered. The generating function for the number of
Hamiltonian cycles is obtained and its singularity is studied. Relation to
two-dimensional quantum gravity is discussed.

Affiliated with

Also associated with

No associations

Rating

Counting Hamiltonian cycles on planar random lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Hamiltonian cycles on planar random lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Hamiltonian cycles on planar random lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-413398