Search for minimal trivalent cycle permutation graphs with girth nine

✍ Scribed by Tomaž Pisanski; John Shawe-Taylor

• Publisher: Elsevier Science
• Year: 1981
• Tongue: English
• Weight: 151 KB
• Volume: 36
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/s0012-365x(81)80010-6

✦ Synopsis

The question of the girth of cycle permutation graphs is discussed.

It is demonstrated by a computer search, that there are no cycle permutation graphs with girth 9 on less than 60 vertices, and that precisely two non-isomorphic examples exist on 60 vertices.