University of TehranJournal of Algorithms and Computation2476-277648120161208On the tenacity of cycle permutation graph3744793810.22059/jac.2016.7938END.JelodarUniversity of Tehran, Department of Algorithms and ComputationD.MoazzamiUniversity of Tehran, College of Engineering, Department of Engineering ScienceP.NasehpourUniversity of Tehran, College of Engineering, Department of Engineering Science0000-0001-6625-364XJournal Article20160220A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph <em>P<sub>n</sub></em>(<em>α</em>) is defined by taking two vertex-disjoint cycles on <em>n</em> vertices and adding a matching between the vertices of the two cycles.<br />In this paper we determine a good upper bound for tenacity of cycle permutation graphs.https://jac.ut.ac.ir/article_7938_a7b34f56efc535ed46a94f44aa7e3d23.pdf