Enumerating typical abelian coverings of Cayley graphs
From MaRDI portal
Publication:389205
DOI10.1016/j.disc.2013.03.021zbMath1408.05106arXiv1208.1342OpenAlexW2069164748MaRDI QIDQ389205
Publication date: 20 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.1342
Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating typical abelian prime-fold coverings of a circulant graph
- On computing the number of subgroups of a finite Abelian group
- Typical circulant double coverings of a circulant graph.
- Fonctions de Möbius sur les groupes abeliens finis
- Enumeration of Certain Subgroups of Abelian p-Groups
- Erratum: Enumerating Typical Circulant Covering Projections onto a Circulant Graph
- A Unimodality Result in the Enumeration of Subgroups of a Finite Abelian Group
- On prime power Abelian groups
This page was built for publication: Enumerating typical abelian coverings of Cayley graphs