Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems
From MaRDI portal
Recommendations
- Analytical enumeration of circulant graphs with prime-squared number of vertices
- From Schur rings to constructive and analytical enumeration of circulant graphs with prime-cubed number of vertices
- scientific article; zbMATH DE number 3933107
- Some identities for enumerators of circulant graphs
- Enumeration of the Adám isomorphic classes of circulants. I
Cited in
(13)- Enumeration of 2-regular circulant graphs and directed double networks
- Schur rings.
- Circulant graphs and tessellations on flat tori
- Orbit polynomial graphs of prime order
- Analytical enumeration of circulant graphs with prime-squared number of vertices
- Counting Schur rings over cyclic groups
- Orbit-counting polynomials for graphs and codes
- From Schur rings to constructive and analytical enumeration of circulant graphs with prime-cubed number of vertices
- The discovery and enumeration of representative symbols for circulant tournaments
- scientific article; zbMATH DE number 3933107 (Why is no real title available?)
- A construction of the automorphism groups of indecomposable S-rings over \(Z_{2^n}\)
- Enumerating Cayley (di-)graphs on dihedral groups
- Enumeration of dicirculant digraphs
This page was built for publication: Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972140)
