On the Toughness of Cycle Permutation Graphs


    loading  Checking for direct PDF access through Ovid

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].

    loading  Loading Related Articles