Some computational aspects of solvable regular covers of graphs
From MaRDI portal
Publication:2343238
DOI10.1016/j.jsc.2014.09.023zbMath1310.05175OpenAlexW1986204656MaRDI QIDQ2343238
Publication date: 4 May 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2014.09.023
experimental comparisonvoltagesgroup extensioncovering projectionlifting automorphismssolvable regular cover
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
On split liftings with sectional complements ⋮ ON GRAPHS OF PRIME VALENCY ADMITTING A SOLVABLE ARC-TRANSITIVE GROUP ⋮ Smallest tetravalent half-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8 ⋮ Computing stable epimorphisms onto finite groups
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arc-transitive elementary abelian covers of the complete graph \(K_{5}\)
- Elementary abelian covers of graphs
- On cubic graphs admitting an edge-transitive solvable group
- A classification of cubic \(s\)-regular graphs of order \(14p\)
- Peakword condensation and submodule lattices: An application of the Meat- Axe
- Action graphs and coverings
- The Magma algebra system. I: The user language
- Group actions, coverings and lifts of automorphisms
- Automorphisms of graphs and coverings
- Linear criteria for lifting automorphisms of elementary abelian regular coverings
- Lifting graph automorphisms by voltage assignments
- An algorithmic approach to fundamental groups and covers of combinatorial cell complexes
- Arc-transitive abelian regular covers of cubic graphs
- Invariant subspaces, duality, and covers of the Petersen graph
- A census of semisymmetric cubic graphs on up to 768 vertices
- Some remarks on the computation of complements and normalizers in soluble groups
- Semisymmetric elementary Abelian covers of the Möbius-Kantor graph
- Constructing 5-Arc-Transitive Cubic Graphs
- s‐Regular cubic graphs as coverings of the complete bipartite graph K3,3
- The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
- Coverings of graphs and maps, orthogonality, and eigenvectors
