Isomorphism checking of \(I\)-graphs

DOI10.1007/s00373-011-1086-2zbMath1256.05153MaRDI QIDQ1928286

Tomaž Pisanski, Arjana Žitnik, Boris Horvat

Publication date: 3 January 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1086-2

zbMATH Keywords

isomorphism; generalized Petersen graph; \(I\)-graph

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C75: Structural characterization of families of graphs

11A07: Congruences; primitive roots; residue systems

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials, Arc‐transitive bicirculants, \(GI\)-graphs: a new class of graphs with many symmetries, Counting rooted spanning forests in cobordism of two circulant graphs, Counting spanning trees in cobordism of two circulant graphs, On the minimum vertex cover of generalized Petersen graphs, On the odd girth and the circular chromatic number of generalized Petersen graphs, Distinguishing graphs via cycles

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ERCS08: A FORTRAN program equipped with a windows graphics user interface that calculates ECPSSR cross sections for the removal of atomic electrons
• Vertex-transitive expansions of (1, 3)-trees
• Products of unit distance graphs
• The isomorphism classes of the generalized Petersen graphs
• Symmetric Y-graphs and H-graphs
• A note on the generalized Petersen graphs that are also Cayley graphs
• ALL GENERALIZED PETERSEN GRAPHS ARE UNIT-DISTANCE GRAPHS
• Enumeration of I-graphs: Burnside does it again
• Which generalized petersen graphs are cayley graphs?
• A theorem on tait colorings with an application to the generalized Petersen graphs
• I-graphs and the corresponding configurations
• Self-dual configurations and regular graphs