Search for minimal trivalent cycle permutation graphs with girth nine |
| |
| Authors: | Tomaž Pisanski John Shawe-Taylor |
| |
| Affiliation: | University of Ljubljana, Department of Mathematics, Jadranska 19, 61000 Ljubljana, Yugoslavia |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
