Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems

DOI10.1016/S0012-365X(99)00139-9zbMath0943.05046OpenAlexW2078239405MaRDI QIDQ1972140

Valery A. Liskovets, Reinhard Pöschel

Publication date: 5 September 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00139-9

zbMATH Keywords

Catalan numberenumerationgroup actionisomorphismcirculant graphsinteger lattice

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

Enumerating Cayley (di-)graphs on dihedral groups ⋮ From Schur Rings to Constructive and Analytical Enumeration of Circulant Graphs with Prime-Cubed Number of Vertices ⋮ A construction of the automorphism groups of indecomposable S-rings over \(Z_{2^n}\) ⋮ Counting Schur rings over cyclic groups ⋮ Schur rings. ⋮ Circulant graphs and tessellations on flat tori