GENERALIZATION OF LINE CONNECTIVITY AND OPTIMALLY INVULNERABLE GRAPHS

被引：22

作者：

BOESCH, FT

CHEN, S

机构：

来源：

关键词：

D O I：

10.1137/0134052

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：657 / 665

页数：9

共 13 条

AMIN, AT ;

HAKIMI, SL .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1973, CT20 (01) :2-10

[2] ON GRAPHS OF INVULNERABLE COMMUNICATION NETS [J].

BOESCH, FT ;

THOMAS, RE .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1970, CT17 (02) :183-&

[3] MINIMUM M-DEGREE VULNERABILITY CRITERION [J].

BOESCH, FT ;

FELZER, AP .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1971, CT18 (02) :224-&

[4]

BOESCH FT, 1970, NETWORKS, V2, P261

[5] A GRAPH-THEORETIC APPROACH TO A COMMUNICATIONS PROBLEM [J].

CHARTRAND, G .

[6]

HARARY F, 1972, P NATL ACAD SCI USA, V28, P1142

[7]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[8]

Hu T.C., 1969, INTEGER PROGRAMMING

[9]

Longyear J. Q., 1970, Journal of Combinatorial Theory, Series A, V9, P420, DOI 10.1016/S0021-9800(70)80095-3

[10]

Singleton R.C., 1966, J COMB THEORY, V1, P306, DOI DOI 10.1016/S0021-9800(66)80054-6