Constructing the vertex-transitive graphs of order 24
From MaRDI portal
Publication:908938
DOI10.1016/S0747-7171(89)80033-1zbMath0694.05032WikidataQ56988379 ScholiaQ56988379MaRDI QIDQ908938
Cheryl E. Praeger, Gordon F. Royle
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (6)
On isomorphisms of Marušič-Scapellato graphs ⋮ Generation of Colourings and Distinguishing Colourings of Graphs ⋮ Tetravalent half-transitive graphs of order \(4p\) ⋮ Pentavalent symmetric graphs of order 16p ⋮ There exists no tetravalent half-arc-transitive graph of order \(2p^{2}\) ⋮ Non-Cayley vertex-transitive graphs of order twice the product of two odd primes
Uses Software
Cites Work
- The mechanical computation of first and second cohomology groups
- The transitive groups of degree twelve
- Interconnection Networks Based on a Generalization of Cube-Connected Cycles
- Transitive Graphs With Fewer Than Twenty Vertices
- Distance-Regular Graphs with Diameter Three
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constructing the vertex-transitive graphs of order 24