Isomorphism checking of I-graphs
DOI10.1007/S00373-011-1086-2zbMATH Open1256.05153OpenAlexW2067865581MaRDI QIDQ1928286FDOQ1928286
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
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]\)
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Congruences; primitive roots; residue systems (11A07)
Cites Work
- ERCS08: A FORTRAN program equipped with a windows graphics user interface that calculates ECPSSR cross sections for the removal of atomic electrons
- The On-Line Encyclopedia of Integer Sequences
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Self-dual configurations and regular graphs
- Which generalized petersen graphs are cayley graphs?
- Representing graphs and maps
- The isomorphism classes of the generalized Petersen 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
- Title not available (Why is that?)
- I-graphs and the corresponding configurations
- Vertex-transitive expansions of (1, 3)-trees
- Products of unit distance graphs
- Symmetric Y-graphs and H-graphs
- Unit distance representations of the Petersen graph in the plane.
Cited In (17)
- Isomorphism certificates for undirected graphs
- Arc‐transitive bicirculants
- \(GI\)-graphs: a new class of graphs with many symmetries
- Isomorphism testing for circulant graphs \(C_n (a, b)\)
- Distinguishing graphs via cycles
- On the minimum vertex cover of generalized Petersen graphs
- Counting spanning trees in cobordism of two circulant graphs
- On the odd girth and the circular chromatic number of generalized Petersen graphs
- Characterization of generalised Petersen graphs that are Kronecker covers
- All generalized Petersen graphs are unit-distance graphs
- The isodominism class of the graphs
- Counting rooted spanning forests in cobordism of two circulant graphs
- Enumeration of I-graphs: Burnside does it again
- Isomorphism identification of graphs: especially for the graphs of kinematic chains
- The isomorphism classes of the generalized Petersen graphs
- Efficient Method to Perform Isomorphism Testing of Labeled Graphs
- On Jacobian group and complexity of \(I\)-graph \(I(n, k, l)\) through Chebyshev polynomials
Uses Software
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)
