Title of article :
On the tenacity of cycle permutation graph
Author/Authors :
Jelodar, D Department of Algorithms and Computation - University of Tehran , Moazzami, D Department of Engineering Science - College of Engineering - University of Tehran , Nasehpour, P Department of Engineering Science - College of Engineering - University of Tehran
Abstract :
A special class of cubic graphs are the cycle permutation
graphs. A cycle permutation graph Pn(a) 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.
Keywords :
Tenacity , Tenacious , Cycle Permutation , Toughness , Integrity
Journal title :
Astroparticle Physics
