Isomorphism checking of I-graphs

DOI10.1007/S00373-011-1086-2MaRDI QIDQ1928286zbMATH OpenOpenAlexFDO

Authors Boris Horvat, Tomaž Pisanski, Arjana Žitnik

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

\(I\)-graphgeneralized Petersen graphisomorphism

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75) Congruences; primitive roots; residue systems (11A07)

Recommendations

• I-graphs and the corresponding configurations
• The isomorphism classes of the generalized Petersen graphs
• Enumeration of I-graphs: Burnside does it again
• All generalized Petersen graphs are unit-distance graphs
• A note on isomorphic generalized Petersen graphs with an application to the crossing number of \(GP[3k-1,k]\) and \(GP[3k+1,k]\)

Cites work

• A note on the generalized Petersen graphs that are also Cayley graphs
• A theorem on tait colorings with an application to the generalized Petersen graphs
• All generalized Petersen graphs are unit-distance graphs
• Enumeration of I-graphs: Burnside does it again
• ERCS08: A FORTRAN program equipped with a windows graphics user interface that calculates ECPSSR cross sections for the removal of atomic electrons
• scientific article; zbMATH DE number 3349883 (Why is no real title available?)
• I-graphs and the corresponding configurations
• Products of unit distance graphs
• Representing graphs and maps
• Self-dual configurations and regular graphs
• Symmetric Y-graphs and H-graphs
• The isomorphism classes of the generalized Petersen graphs
• The On-Line Encyclopedia of Integer Sequences
• Unit distance representations of the Petersen graph in the plane.
• Vertex-transitive expansions of (1, 3)-trees
• Which generalized petersen graphs are cayley graphs?

Cited in

(19)

• Counting spanning trees in cobordism of two circulant graphs
• Isomorphism certificates for undirected 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
• All generalized Petersen graphs are unit-distance graphs
• Isomorphism testing for circulant graphs C_n (a, b)
• Enumeration of I-graphs: Burnside does it again
• Efficient Method to Perform Isomorphism Testing of Labeled Graphs
• 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 isodominism class of the graphs
• Arc‐transitive bicirculants
• 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
• Isomorphism identification of graphs: especially for the graphs of kinematic chains
• The isomorphism classes of the generalized Petersen graphs

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Isomorphism checking of \(I\)-graphs

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