On the tenacity of cycle permutation graph

Jelodar, D.; Moazzami, D.; Nasehpour, P.

doi:10.22059/jac.2016.7938

On the tenacity of cycle permutation graph

Document Type : Research Paper

Authors

D. Jelodar ¹

D. Moazzami ²

P. Nasehpour ²

¹ University of Tehran, Department of Algorithms and Computation

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

https://doi.org/10.22059/jac.2016.7938

Abstract

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph P_n(α) 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