Pisanski, T. and Shawe-Taylor, J. (1981) Search for Minimal Trivalent Cycle Permutation Graphs with Girth Nine. Discrete Mathenatics, 36, 113-115.
Record type:
Article
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.
This record has no associated files available for download.
More information
Published date: 1981
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 259868
URI: http://eprints.soton.ac.uk/id/eprint/259868
ISSN: 0012-365X
PURE UUID: d5e2312d-057d-42ac-9b1e-2dfd4888ebd1
Catalogue record
Date deposited: 31 Aug 2004
Last modified: 10 Dec 2021 21:07
Export record
Contributors
Author:
T. Pisanski
Author:
J. Shawe-Taylor
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.