Circulant double coverings of a circulant graph of valency five
From MaRDI portal
Publication:856812
DOI10.1007/s10114-005-0773-4zbMath1110.05081OpenAlexW2041400354MaRDI QIDQ856812
Publication date: 13 December 2006
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-005-0773-4
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Resolvability in circulant graphs, Norm equalities and inequalities for three circulant operator matrices
Cites Work
- Unnamed Item
- Isomorphisms and automorphisms of graph coverings
- Generating all graph coverings by permutation voltage assignments
- Typical circulant double coverings of a circulant graph.
- Regular graph coverings whose covering transformation groups have the isomorphism extension property
- Circulant double coverings of a circulant graph of valency four
- Isomorphism Classes of Concrete Graph Coverings
- Enumeration of Regular Graph Coverings Having Finite Abelian Covering Transformation Groups
- Isomorphism Classes of Graph Bundles
- Enumeration of connected graph coverings
- Enumerating Typical Circulant Covering Projections Onto a Circulant Graph