The isomorphism classes of the generalized Petersen graphs

DOI10.1016/j.disc.2007.12.074zbMath1219.05098OpenAlexW2024186835MaRDI QIDQ998512

Alice Steimle, William Staton

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.074

zbMATH Keywords

automorphismMathematicaisomorphism classesgeneralized Petersen graphsdominating cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (14)

On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials ⋮ On the spectrum of the generalised Petersen graphs ⋮ Component connectivity of generalized Petersen graphs ⋮ Isomorphism checking of \(I\)-graphs ⋮ Independent rainbow domination of graphs ⋮ Counting rooted spanning forests for circulant foliation over a graph ⋮ Beyond symmetry in generalized Petersen graphs ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Graph decompositions in projective geometries ⋮ Most Generalized Petersen graphs of girth 8 have cop number 4 ⋮ Complexity of the circulant foliation over a graph ⋮ Cubic vertex-transitive graphs of order 2pq ⋮ Power domination in cylinders, tori, and generalized Petersen graphs

Uses Software

• Mathematica

Cites Work

• Every generalized Petersen graph has a Tait coloring
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The isomorphism classes of the generalized Petersen graphs