Circulant double coverings of a circulant graph of valency four

DOI10.1007/s00373-005-0623-2zbMath1090.05056OpenAlexW2047548473MaRDI QIDQ2494105

Jin Ho Kwok, Rong Quan Feng

Publication date: 16 June 2006

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-005-0623-2

zbMATH Keywords

Cayley graphGraph coveringVoltage assignment

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Circulant double coverings of a circulant graph of valency five

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isomorphisms and automorphisms of graph coverings
• Distance regular covers of the complete graph
• Generating all graph coverings by permutation voltage assignments
• Typical circulant double coverings of a circulant graph.
• Graph covering projections arising from finite vector spaces over finite fields
• Regular graph coverings whose covering transformation groups have the isomorphism extension property
• 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 connected graph coverings