On the Toughness of Cycle Permutation Graphs |
| |
Authors: | Chao Chong-Yun Shaocen Han |
| |
Affiliation: | (1) Department of Mathematics, University of Pittsburgh, Pittsburgh, PA 15260, USA |
| |
Abstract: | Motivated by the conjectures in [11], we introduce the maximal chains of a cycle permutation graph, and we use the properties of maximal chains to establish the upper bounds for the toughness of cycle permutation graphs. Our results confirm two conjectures in [11]. |
| |
Keywords: | cycle permutation graph toughness maximal chain |
本文献已被 SpringerLink 等数据库收录! |