Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems (Q1972140): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(99)00139-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078239405 / rank | |||
Normal rank | |||
Latest revision as of 12:01, 30 July 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
