Enumeration of I-graphs: Burnside does it again
From MaRDI portal
Publication:3552337
DOI10.26493/1855-3974.113.3dczbMath1230.05031OpenAlexW2127740732WikidataQ129352296 ScholiaQ129352296MaRDI QIDQ3552337
Helena Zakrajšek, Marko Petkovsek
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
Related Items
Counting spanning trees in cobordism of two circulant graphs, Isomorphism checking of \(I\)-graphs, \(GI\)-graphs: a new class of graphs with many symmetries, Recognizing generalized Petersen graphs in linear time, Distinguishing graphs via cycles, On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials, The Number of Cyclic Configurations of Type (v3) and the Isomorphism Problem, On the minimum vertex cover of generalized Petersen graphs, Counting rooted spanning forests in cobordism of two circulant graphs