On the tenacity of cycle permutation graph
Davoud Jelodar, Dara Moazzami, Peyman Nasehpour · International Symposium on Algorithms and Computation · 2016
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn( α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.