ON THE VULNERABILITY OF PERMUTATION GRAPHS OF COMPLETE AND COMPLETE BIPARTITE GRAPHS

被引:0
作者
GUICHARD, D
PIAZZA, B
STUECKLE, S
机构
[1] WHITMAN COLL,WALLA WALLA,WA 99362
[2] UNIV SO MISSISSIPPI,HATTIESBURG,MS 39406
[3] CLEMSON UNIV,CLEMSON,SC 29631
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper the authors study the vulnerability parameters of integrity, toughness, and binding number for two classes of graphs. These two classes of graphs are permutation graphs of complete graphs and permutation graphs of complete bipartite graphs.
引用
收藏
页码:149 / 157
页数:9
相关论文
共 22 条
[1]  
Barefoot C.A., 1987, J COMBIN MATH COMBIN, V1, P13
[2]  
BAREFOOT CA, 1987, C NUMER, V58, P103
[3]  
CHARTRAND G, 1967, ANN I H POINCARE B, V3, P433
[4]  
Chvatal V., 1973, Discrete Mathematics, V5, P215, DOI 10.1016/0012-365X(73)90138-6
[5]  
Dorfler W., 1978, MATH SLOVACA, V28, P277
[6]   TOUGHNESS AND THE EXISTENCE OF K-FACTORS [J].
ENOMOTO, H ;
JACKSON, B ;
KATERINIS, P ;
SAITO, A .
JOURNAL OF GRAPH THEORY, 1985, 9 (01) :87-95
[7]  
ENOMOTO H, 1984, GRAPH THEORY APPLICA, V534, P335
[8]  
GUICHARD DR, 1985, ARS COMBINATORIA, V19, P175
[9]  
Kane V. G., 1981, ARS COMBINATORIA, V11, P201
[10]   BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF K-FACTORS [J].
KATERINIS, P ;
WOODALL, DR .
QUARTERLY JOURNAL OF MATHEMATICS, 1987, 38 (150) :221-228