Generalized Petersen graphs which are cycle permutation graphs

DOI10.1016/0095-8956(84)90068-6zbMath0535.05055OpenAlexW2003005859MaRDI QIDQ790849

Richard D. Ringeisen, Sam Stueckle

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90068-6

zbMATH Keywords

generalized Petersen graphscycle permutation graphlabelled graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (6)

Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ On the number of geodesics of Petersen graph \(\mathrm{GP}(n,2)\) ⋮ (G1,G2)-permutation graphs ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ On Ringeisen's isolation game ⋮ On cycle permutation graphs

Cites Work

• On cycle permutation graphs
• Search for minimal trivalent cycle permutation graphs with girth nine
• A result on Hamiltonian cycles in generalized Petersen graphs
• Hamiltonian cycles in generalized Petersen graphs
• 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
• Unnamed Item

This page was built for publication: Generalized Petersen graphs which are cycle permutation graphs