Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems (Q1972140)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1972140 |
scientific article; zbMATH DE number 1423740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems |
scientific article; zbMATH DE number 1423740 |
Statements
Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems (English)
0 references
5 September 2000
0 references
group action
0 references
integer lattice
0 references
circulant graphs
0 references
Catalan number
0 references
enumeration
0 references
isomorphism
0 references
0.8550708889961243
0 references
0.837308943271637
0 references
0.8078547716140747
0 references
0.803941011428833
0 references
