Generalized Petersen graphs which are cycle permutation graphs
From MaRDI portal
A cycle permutation graph is obtained by taking two n-cycles each labelled 1,2,...,n, along with the edges obtained by joining i in the first copy to \(\alpha\) (i) in the second, where \(\alpha \in S_ n\). A characterization of the intersection between cycle permutation graphs and the generalized Petersen graphs as defined by \textit{M. E. Watkins} [J. Comb. Theory 6, 152-164 (1969; Zbl 0175.503)], is given.
Recommendations
Cites work
- A result on Hamiltonian cycles in generalized Petersen graphs
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Every generalized Petersen graph has a Tait coloring
- Hamiltonian cycles in generalized Petersen graphs
- scientific article; zbMATH DE number 3654154 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3349883 (Why is no real title available?)
- On cycle permutation graphs
- Search for minimal trivalent cycle permutation graphs with girth nine
Cited in
(10)- Multiple Petersen subdivisions in permutation graphs
- 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)\)
- Permutation graphs and Petersen graph
- (G₁, G₂)-permutation graphs
- Some families of combination and permutation graphs.
- scientific article; zbMATH DE number 5073484 (Why is no real title available?)
- 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
This page was built for publication: Generalized Petersen graphs which are cycle permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790849)