On the tenacity of cycle permutation graph

07/01/2020

∙

by   Peyman Nasehpour, Ph.D., et al.

∙

0

∙

share

A special class of cubic graphs is the cycle permutation graphs. A cycle permutation graph $P_n(\alpha)$ 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 the tenacity of cycle permutation graphs.