Search for Minimal Trivalent Cycle Permutation Graphs with Girth Nine


Pisanski, T. and Shawe-Taylor, J. (1981) Search for Minimal Trivalent Cycle Permutation Graphs with Girth Nine. Discrete Math., 36, 113-115.

Download

Full text not available from this repository.

Description/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.

Item Type: Article
ISSNs: 0012-365X
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science
ePrint ID: 259868
Date Deposited: 31 Aug 2004
Last Modified: 27 Mar 2014 20:02
Publisher: Elsevier Science Direct
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/259868

Actions (login required)

View Item View Item