On the tenacity of cycle permutation graph

Document Type: Research Paper

Authors

1 University of Tehran, Department of Algorithms and Computation

2 University of Tehran, College of Engineering, Department of Engineering Science

Abstract

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.

Keywords