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.
Jelodar, D., Moazzami, D., & Nasehpour, P. (2016). On the tenacity of cycle permutation graph. Journal of Algorithms and Computation, 48(1), 37-44. doi: 10.22059/jac.2016.7938
MLA
D. Jelodar; D. Moazzami; P. Nasehpour. "On the tenacity of cycle permutation graph". Journal of Algorithms and Computation, 48, 1, 2016, 37-44. doi: 10.22059/jac.2016.7938
HARVARD
Jelodar, D., Moazzami, D., Nasehpour, P. (2016). 'On the tenacity of cycle permutation graph', Journal of Algorithms and Computation, 48(1), pp. 37-44. doi: 10.22059/jac.2016.7938
VANCOUVER
Jelodar, D., Moazzami, D., Nasehpour, P. On the tenacity of cycle permutation graph. Journal of Algorithms and Computation, 2016; 48(1): 37-44. doi: 10.22059/jac.2016.7938
)