Analytical enumeration of circulant graphs with prime-squared number of vertices

zbMath0886.05080MaRDI QIDQ1380699

Reinhard Pöschel, Valery A. Liskovets, Mikhail H. Klin

Publication date: 12 March 1998

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119303

zbMATH Keywords

generating functionstournamentsenumeriation of circulant graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (7)

Commutative Schur Rings of Maximal Dimension ⋮ Structural properties of Toeplitz graphs ⋮ Some identities for enumerators of circulant graphs ⋮ 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}\) ⋮ Enumeration of 2-regular circulant graphs and directed double networks ⋮ Extended Petersen graphs

This page was built for publication: Analytical enumeration of circulant graphs with prime-squared number of vertices