Generalized Petersen graphs which are cycle permutation graphs (Q790849)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized Petersen graphs which are cycle permutation graphs |
scientific article; zbMATH DE number 3849283
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized Petersen graphs which are cycle permutation graphs |
scientific article; zbMATH DE number 3849283 |
Statements
Generalized Petersen graphs which are cycle permutation graphs (English)
0 references
1984
0 references
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.
0 references
labelled graph
0 references
cycle permutation graph
0 references
generalized Petersen graphs
0 references
0.838228166103363
0 references
0.7999697923660278
0 references
0.7924513220787048
0 references
