Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems (Q1972140): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 06:25, 5 March 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
    0 references
    0 references
    5 September 2000
    0 references
    0 references
    group action
    0 references
    integer lattice
    0 references
    circulant graphs
    0 references
    Catalan number
    0 references
    enumeration
    0 references
    isomorphism
    0 references