• DOI:10.4153/CMB-1968-063-0
• Corpus ID: 125070971

An Edge but not Vertex Transitive Cubic Graph*

@article{Bouwer1968AnEB,
  title={An Edge but not Vertex Transitive Cubic Graph*},
  author={I. Z. Bouwer},
  journal={Canadian Mathematical Bulletin},
  year={1968},
  volume={11},
  pages={533 - 535}
}

• I. Bouwer
• Published 1 October 1968
• Mathematics
• Canadian Mathematical Bulletin

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.