From Schur Rings to Constructive and Analytical Enumeration of Circulant Graphs with Prime-Cubed Number of Vertices
DOI10.1007/978-3-030-32808-5_2zbMath1436.05044arXiv1512.07744OpenAlexW2999136978MaRDI QIDQ3296724
Valery A. Liskovets, Josef Lauri, Victoria Gatt, Mikhail H. Klin
Publication date: 1 July 2020
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.07744
combinatorial identitycyclic groupmultiplierself-complementary graphscirculant graphgraph isomorphism\(S\)-ringconstructive enumerationenumeration under group actionPólya's method
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Group rings of finite groups and their modules (group-theoretic aspects) (20C05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of self-dual configurations
- Analytical enumeration of circulant graphs with prime-squared number of vertices
- Some identities for enumerators of circulant graphs
- Ádám's conjecture is true in the square-free case
- Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems
- Topics in Graph Automorphisms and Reconstruction
- A solution of the isomorphism problem for circulant graphs
- Untersuchungen von S‐Ringen, insbesondere im Gruppenring von p‐Gruppen
- Graphs with circulant adjacency matrices
This page was built for publication: From Schur Rings to Constructive and Analytical Enumeration of Circulant Graphs with Prime-Cubed Number of Vertices