Enumeration of I-graphs: Burnside does it again

Marko Petkovšek, Helena Zakrajšek


We give explicit and efficiently computable formulas for the number of isomorphism classes of I-graphs, connected I-graphs, bipartite connected I-graphs, generalized Petersen graphs, and bipartite generalized Petersen graphs. The tool that we use is the well-known Cauchy-Frobenius-Burnside lemma.


I-graphs, generalized Petersen graphs, Cauchy-Frobenius-Burnside lemma, arithmetical functions

Full Text:


DOI: https://doi.org/10.26493/1855-3974.113.3dc

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications