The University of Southampton
University of Southampton Institutional Repository

Net structure in graphs

Net structure in graphs
Net structure in graphs

A graph in said to be a general (g,h) not if and only if (1) it has girth g and (2) it contains a collection of circuits of length h called special circuits such that, every edge of the graph in in precisely two of the circuits. (h is the mesh). When the graph is trivalent it can be embedded on a surface no that the special circuits bound the faces. The definition can be modified so that thin property holds for arbitrary valency y. Nets which have even Euler characteristic but for which the embedding is non-orientable are called quirks. Trivalent nets are considered and the existence of (1) triangle nets (girth 3) for arbitrary mesh h >,3 (2) quirks (3) bipartite hamiltonian nets (mesh - order (number of vertices)) is settled. The vertex-special circuit incidence matrix is called a net matrix. It is shown that when conditions are imposed on g-nets (mesh girth) interesting matrix equations result and that for trivalent nets the spectrum of the dual is restricted. Trivej.ont g-nets of minimum order for g C 6 are known graphs but it is shown that there is no 7-not of order 28 even though the 7-cage has order 24. Two (6,7) nets are determined however which satisfy strong necessary conditions and are called near 7-nets. If the special circuits in a hamiltonian net degenerate into cycles then the net is called a global net. Trivalent orientable global nets are shown to be bipartite and this motivates the definition of a word net. A word net is determined by a single word relation of even length 2. It is shown that finite word nets are always (g,h) nets and complete classifications are given for (1) length 4 and y e(3,4,5} (2) trivalent graphs with I a{6,8}.

University of Southampton
Evans, Charles William
Evans, Charles William

Evans, Charles William (1977) Net structure in graphs. University of Southampton, Doctoral Thesis.

Record type: Thesis (Doctoral)

Abstract

A graph in said to be a general (g,h) not if and only if (1) it has girth g and (2) it contains a collection of circuits of length h called special circuits such that, every edge of the graph in in precisely two of the circuits. (h is the mesh). When the graph is trivalent it can be embedded on a surface no that the special circuits bound the faces. The definition can be modified so that thin property holds for arbitrary valency y. Nets which have even Euler characteristic but for which the embedding is non-orientable are called quirks. Trivalent nets are considered and the existence of (1) triangle nets (girth 3) for arbitrary mesh h >,3 (2) quirks (3) bipartite hamiltonian nets (mesh - order (number of vertices)) is settled. The vertex-special circuit incidence matrix is called a net matrix. It is shown that when conditions are imposed on g-nets (mesh girth) interesting matrix equations result and that for trivalent nets the spectrum of the dual is restricted. Trivej.ont g-nets of minimum order for g C 6 are known graphs but it is shown that there is no 7-not of order 28 even though the 7-cage has order 24. Two (6,7) nets are determined however which satisfy strong necessary conditions and are called near 7-nets. If the special circuits in a hamiltonian net degenerate into cycles then the net is called a global net. Trivalent orientable global nets are shown to be bipartite and this motivates the definition of a word net. A word net is determined by a single word relation of even length 2. It is shown that finite word nets are always (g,h) nets and complete classifications are given for (1) length 4 and y e(3,4,5} (2) trivalent graphs with I a{6,8}.

This record has no associated files available for download.

More information

Published date: 1977

Identifiers

Local EPrints ID: 459982
URI: http://eprints.soton.ac.uk/id/eprint/459982
PURE UUID: 8bf62fec-adcf-4e8b-a7a3-010cf0be5262

Catalogue record

Date deposited: 04 Jul 2022 17:32
Last modified: 04 Jul 2022 17:32

Export record

Contributors

Author: Charles William Evans

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.

×