On the toughness of cycle permutation graphs

被引：0

作者：

Chao, CY ^{[1
]}

Han, S ^{[1
]}

机构：

[1] Univ Pittsburgh, Dept Math, Pittsburgh, PA 15260 USA

来源：

CZECHOSLOVAK MATHEMATICAL JOURNAL | 2001年 / 51卷 / 02期

关键词：

cycle permutation graph; toughness; maximal chain;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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

引用

页码：239 / 260

页数：22

共 12 条

[1]

BAUER D, 1995, P 7 QUADR INT C THEO, P19

[2]

Bauer D., 1991, P 6 INT C THEORY APP, P113

[3] On the classification and toughness of generalized permutation star-graphs [J].

Chao, CY ;

Han, SC .

CZECHOSLOVAK MATHEMATICAL JOURNAL, 1997, 47 (03) :431-452

[4]

CHARTRAND G, 1982, PETERSEN GRAPH GRAPH, P69

[5]

CHVATAL V, 1979, MATH SOLVACA, V28, P215

[6]

DOFLER W, 1979, MATH SLOVACA, V28, P277

[7]

FERLAND K, 1993, ARS COMBINATORIA, P65

[8] The toughness of cubic graphs [J].

Goddard, W .

GRAPHS AND COMBINATORICS, 1996, 12 (01) :17-22

[9]

GUICHARD D, 1991, ARS COMBINATORIA, V31, P149

[10]

PIAZZA B, 1990, ARS COMBINATORIA, V29, P289

← 1 2 →