On the tenacity of cycle permutation graph
نویسندگان
1 University of Tehran, Department of Algorithms and Computation
2 University of Tehran, College of Engineering, Department of Engineering Science
3 University of Tehran, College of Engineering, Department of Engineering Science
doi
10.22059/jac.2016.7938چکیده
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.
