Upper Bounds for the Number of Hamiltonian Cycles

Details Upper Bounds for the Number of Hamiltonian Cycles Upper Bounds for the Number of Hamiltonian Cycles

2007-12-04

arxiv.org/abs/0712.0616v5

Computer Science

Discrete Mathematics

8 pages

Scientific paper

An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that counting the number of Hamiltonian cycles of an undirected graph can be done by counting the number of Hamiltonian cycles of its corresponding symmetric directed graph. In this way, an upper bound for the number of Hamiltonian cycles of undirected graphs is also obtained.

Affiliated with

Also associated with

No associations

Rating

Upper Bounds for the Number of Hamiltonian Cycles 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 Upper Bounds for the Number of Hamiltonian Cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper Bounds for the Number of Hamiltonian Cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-310106