Linking rings structures and semisymmetric graphs: Cayley constructions
From MaRDI portal
Publication:499450
DOI10.1016/j.ejc.2015.05.004zbMath1321.05114MaRDI QIDQ499450
Primož Potočnik, Stephen E. Wilson
Publication date: 30 September 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2015.05.004
20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05E18: Group actions on combinatorial structures
Related Items
Linking rings structures and semisymmetric graphs: Combinatorial constructions, Recipes for edge-transitive tetravalent graphs, Resolution of a conjecture about linking ring structures, The separated box product of two digraphs
Uses Software
Cites Work
- Tetravalent edge-transitive graphs of girth at most 4
- Semisymmetric graphs from polytopes
- A classification of tightly attached half-arc-transitive graphs of valency 4
- Half-transitive group actions on finite graphs of valency 4
- The Magma algebra system. I: The user language
- Cubic vertex-transitive graphs on up to 1280 vertices
- A census of semisymmetric cubic graphs on up to 768 vertices
- Classification of half-arc-transitive graphs of order \(4p\)
- On edge but not vertex transitive regular graphs
- Linking rings structures and tetravalent semisymmetric graphs
- A Class of semisymmetric graphs
- Finite graphs of valency 4 and girth 4 admitting half-transitive group actions
- An infinite series of regular edge- but not vertex-transitive graphs
- A census of 4-valent half-arc-transitive graphs and arc-transitive digraphs of valence two
- Some recent discoveries about half-arc-transitive graphs
- Regular line-symmetric graphs