Title of article
Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems Original Research Article
Author/Authors
The set of circulant graphs with pk vertices (k?1، نويسنده , , p an odd prime) is decomposed into a collection of well-specified subsets. The number of these subsets is equal to the kth Catalan number، نويسنده , , explicit uniform counting formulae have been obtained for various types of circulant graphs with p2 vertices.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
19
From page
173
To page
191
Abstract
Valery Liskovets, Reinhard Pöschel
Keywords
Cyclic graph , Enumeration under group action , Graph isomorphism , Multiplier , Monotone walk , Plane integer lattice , Catalan number , Circulant graph
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950350
Link To Document