Enumerating Typical Circulant Covering Projections Onto a Circulant Graph

DOI10.1137/S0895480103431861MaRDI QIDQ5317609zbMATH OpenOpenAlexFDO

Authors Jin Ho Kwak, Young Soo Kwon, Rongquan Feng

Publication date 16 September 2005

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480103431861

zbMATH Keywords

circulant graphenumerationgraph coveringvoltage assignment

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Recommendations

• Enumerating abelian typical cube-free fold coverings of a circulant graph
• Enumerating typical abelian prime-fold coverings of a circulant graph
• Typical circulant double coverings of a circulant graph.
• Circulant double coverings of a circulant graph of valency four
• Counting some finite-fold coverings of a graph

Cited in

(7)

• Enumerating typical abelian prime-fold coverings of a circulant graph
• scientific article; zbMATH DE number 54783 (Why is no real title available?)
• A Note on Counting Connected Graph Covering Projections
• Enumeration of Concrete Regular Covering Projections
• Enumerating abelian typical cube-free fold coverings of a circulant graph
• Typical Frobenius coverings
• Circulant double coverings of a circulant graph of valency five

This page was built for publication: Enumerating Typical Circulant Covering Projections Onto a Circulant Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317609)