Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems (Q1972140): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:38, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems |
scientific article |
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
