Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T09:43:12.775Z Has data issue: false hasContentIssue false

An Edge but not Vertex Transitive Cubic Graph*

Published online by Cambridge University Press:  20 November 2018

I. Z. Bouwer*
Affiliation:
National Research Institute for Mathematical Sciences, Pretoria,, South Africa
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let G be an undirected graph, without loops or multiple edges. An automorphism of G is a permutation of the vertices of G that preserves adjacency. G is vertex transitive if, given any two vertices of G, there is an automorphism of the graph that maps one to the other. Similarly, G is edge transitive if for any two edges (a, b) and (c, d) of G there exists an automorphism f of G such that {c, d} = {f(a), f(b)}. A graph is regular of degree d if each vertex belongs to exactly d edges.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1968