GRAPHS AS MODELS OF COMMUNICATION-NETWORK VULNERABILITY - CONNECTIVITY AND PERSISTENCE

被引：24

作者：

BOESCH, FT ^{[1
]}

HARARY, F ^{[1
]}

KABELL, JA ^{[1
]}

机构：

[1] UNIV MICHIGAN,ANN ARBOR,MI 48109

来源：

关键词：

D O I：

10.1002/net.3230110106

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：57 / 63

页数：7

共 10 条

[1] CONNECTIVITY FUNCTION OF A GRAPH [J].

BEINEKE, LW ;

HARARY, F .

[2]

Berge C., 1958, THEORIE GRAPHES SES

BOESCH, FT ;

SUFFEL, CL .

[4]

BOESCH FT, UNPUBLISHED

[5]

BOLLOBAS B, 1968, THEORY GRAPHS, P29

[6] MAXIMUM CONNECTIVITY OF A GRAPH [J].

HARARY, F .

[7]

HARARY F, 1970, SIAM STUDIES APPLIED, V4, P112

[8]

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

[9]

HARTMAN J, 1978, SPRINGER LECT NOTES, V642, P247

[10]

KABELL JA, 1979, ANN NY ACAD SCI, V319, P572