An edge but not vertex transitive cubic graph

@article{Bouwer1968AnEB,
  title={An edge but not vertex transitive cubic graph},
  author={I. Bouwer},
  journal={Canadian Mathematical Bulletin},
  year={1968},
  volume={11},
  pages={533-535}
}
  • I. Bouwer
  • Published 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. In [1, § 3… Expand
73 Citations
CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p2
  • 10
  • PDF
Classifying cubic edge-transitive graphs of order 8p
  • 1
  • PDF
Classifying Cubic Semisymmetric Graphs of Order 18 pn
  • 2
Semisymmetric graphs of order 2p3
  • 3
  • PDF
The Gray graph revisited
  • 5
  • PDF
Edge-transitive bi-Cayley graphs
  • 6
  • PDF
Cubic semisymmetric graphs of order 6p3
  • 7
  • PDF
An infinite family of cubic edge- but not vertex-transitive graphs
  • 46
  • PDF
Vertex-transitive graphs and their arc-types
  • 4
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
Regular line-symmetric graphs
  • 132
National Research Institute for Mathematical Sciences
  • National Research Institute for Mathematical Sciences