The University of Southampton
University of Southampton Institutional Repository

Search for Minimal Trivalent Cycle Permutation Graphs with Girth Nine

Record type: Article

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.

Full text not available from this repository.

Citation

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

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: 18 Jul 2017 09:19

Export record

Contributors

Author: T. Pisanski
Author: J. Shawe-Taylor

University divisions


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.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×