Generalized petersen graphs which are cycle permutation graphs |
| |
Authors: | S Stueckle RD Ringeisen |
| |
Institution: | Department of Mathematical Sciences, Clemson University, Clemson, South Carolina 29631 USA |
| |
Abstract: | A cycle permutation graph is obtained by taking two n-cycles each labeled 1, 2,…, n, along with the edges obtained by joining i in the first copy to α(i) in the second, where α ∈ Sn. A characterization of the intersection between cycle permutation graphs and the generalized Petersen graphs as defined by Watkins (J. Combin. Theory6 (1969), 152–164), is given. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|