Enumerating typical abelian prime-fold coverings of a circulant graph
From MaRDI portal
Publication:1025472
DOI10.1016/j.disc.2008.04.045zbMath1229.05228OpenAlexW2052946674MaRDI QIDQ1025472
Young Soo Kwon, Rong Quan Feng, Jin Ho Kwok
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.045
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (2)
Cites Work
- Generating all graph coverings by permutation voltage assignments
- Optimal distributed algorithms in unlabeled tori and chordal rings
- Typical circulant double coverings of a circulant graph.
- Graph covering projections arising from finite vector spaces over finite fields
- Erratum: Enumerating Typical Circulant Covering Projections onto a Circulant Graph
- Isomorphism Classes of Concrete Graph Coverings
- Enumeration of Regular Graph Coverings Having Finite Abelian Covering Transformation Groups
- A Note on Counting Connected Graph Covering Projections
- Isomorphism Classes of Graph Bundles
- Enumeration of Concrete Regular Covering Projections
This page was built for publication: Enumerating typical abelian prime-fold coverings of a circulant graph