Computational determination of (3,11) and (4,7) cages

Details Computational determination of (3,11) and (4,7) cages Computational determination of (3,11) and (4,7) cages

2010-09-19

arxiv.org/abs/1009.3608v1

Mathematics

Combinatorics

Scientific paper

A (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum order. We show that a (3,11)-graph of order 112 found by Balaban in 1973 is minimal and unique. We also show that the order of a (4,7)-cage is 67 and find one example. Finally, we improve the lower bounds on the orders of (3,13)-cages and (3,14)-cages to 202 and 260, respectively. The methods used were a combination of heuristic hill-climbing and an innovative backtrack search.

Affiliated with

Also associated with

No associations

Rating

Computational determination of (3,11) and (4,7) cages 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 Computational determination of (3,11) and (4,7) cages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational determination of (3,11) and (4,7) cages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-408636