GI-graphs: a new class of graphs with many symmetries
DOI10.1007/S10801-013-0484-3zbMATH Open1297.05108OpenAlexW2070896833MaRDI QIDQ402939FDOQ402939
Authors: Marston D. E. Conder, Tomaž Pisanski, Arjana Žitnik 
Publication date: 29 August 2014
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-013-0484-3
Recommendations
- Symmetry and connectivity in G-graphs
- Generalized symmetry of graphs - a survey
- Generalized Gardiner-Praeger graphs and their symmetries
- Symmetric and semisymmetric graphs construction using \(G\)-graphs
- Generalized symmetry of graphs
- On several symmetry conditions for graphs
- On the symmetries of some classes of recursive circulant graphs
- Symmetries in graphs via simplicial automorphisms
- scientific article; zbMATH DE number 579475
- G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
automorphism groupgeneralized Petersen graphcirculant graphedge-transitive graphvertex-transitive graphwreath product\(GI\)-graphunit-distance graph
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Configurations from a graphical viewpoint
- The Real Configuration (214 )
- On the groups of repeated graphs
- Self-dual configurations and regular graphs
- Title not available (Why is that?)
- Which generalized petersen graphs are cayley graphs?
- A note on a conjecture on consistent cycles
- A note on the generalized Petersen graphs that are also Cayley graphs
- Isomorphism checking of \(I\)-graphs
- All generalized Petersen graphs are unit-distance graphs
- Enumeration of I-graphs: Burnside does it again
- Title not available (Why is that?)
- I-graphs and the corresponding configurations
- Automorphisms of circulants that respect partitions
- Generalizing the generalized Petersen graphs
- Multiple Kronecker covering graphs
- Vertex-transitive expansions of (1, 3)-trees
- Products of unit distance graphs
Cited In (10)
- G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
- A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra
- Title not available (Why is that?)
- Special issue of ADAM devoted to the International Workshop on Symmetries of Graph and Networks 2018
- A new generalization of generalized Petersen graphs
- On the automorphism groups of the generalized Peterson graphs
- Two new families of non-CCA groups
- Title not available (Why is that?)
- Petersen type \(n\)-circulant and weak metacirculant
- Weak metacirculants of odd prime power order
Uses Software
This page was built for publication: \(GI\)-graphs: a new class of graphs with many symmetries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402939)
