Recipes for edge-transitive tetravalent graphs
DOI:
https://doi.org/10.26493/2590-9770.1269.732Keywords:
Graph, automorphism group, symmetryAbstract
This paper presents all constructions known to the authors which result in tetravalent graphs whose symmetry groups are large enough to be transitive on the edges of the graph.
Downloads
Published
2020-08-17
Issue
Section
International Workshop on Symmetries of Graph and Networks 2018