Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-30T15:00:31.035Z Has data issue: false hasContentIssue false
  • English
  • Français

An Edge but not Vertex Transitive Cubic Graph*

Published online by Cambridge University Press:  20 November 2018

I. Z. Bouwer
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.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 11 , Issue 4 , October 1968 , pp. 533 - 535
Copyright
Copyright © Canadian Mathematical Society 1968

Footnotes

*

The graph described in this note was discovered by Dr. Marion C. Gray in 1932. The author has independently rediscovered it and believes that it here appears in print for the first time.

References

1. Folkman, J., Regular line-symmetric graphs. J. Combinatorial theory 3 (1967) 215-232.Google Scholar