Enumeration of I-graphs: Burnside does it again

DOI10.26493/1855-3974.113.3DCMaRDI QIDQ3552337zbMATH OpenOpenAlexWikidataFDO

Authors Helena Zakrajšek, Marko Petkovšek

Publication date 15 April 2010

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.113.3dc

zbMATH Keywords

arithmetical functionsCauchy-Frobenius-Burnside Lemmageneralized Petersen graphsI-graphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Recommendations

• Isomorphism checking of \(I\)-graphs
• I-graphs and the corresponding configurations
• scientific article; zbMATH DE number 5606398
• Enumeration of connected invariant graphs
• The isomorphism classes of the generalized Petersen graphs

Cited in

(12)

• Counting spanning trees in cobordism of two circulant graphs
• Isomorphism checking of \(I\)-graphs
• On the minimum vertex cover of generalized Petersen graphs
• Recognizing generalized Petersen graphs in linear time
• Distinguishing graphs via cycles
• GI-graphs: a new class of graphs with many symmetries
• On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials
• The number of cyclic configurations of type \((v_{3})\) and the isomorphism problem
• Characterization of generalised Petersen graphs that are Kronecker covers
• The Plans theorem for cones over generalized \(I\)-graphs
• Distinguishing graphs via cycles
• Counting rooted spanning forests in cobordism of two circulant graphs

This page was built for publication: Enumeration of I-graphs: Burnside does it again

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552337)