%0 Journal Article
%T On the tenacity of cycle permutation graph
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Jelodar, D.
%A Moazzami, D.
%A Nasehpour, P.
%D 2016
%\ 12/08/2016
%V 48
%N 1
%P 37-44
%! On the tenacity of cycle permutation graph
%K Tenacity
%K Tenacious
%K Cycle Permutation
%K toughness
%K integrity
%R 10.22059/jac.2016.7938
%X 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.
%U https://jac.ut.ac.ir/article_7938_a7b34f56efc535ed46a94f44aa7e3d23.pdf