GRAPHS WITH GIVEN CONNECTIVITY AND INDEPENDENCE NUMBER OR NETWORKS WITH GIVEN MEASURES OF VULNERABILITY AND SURVIVABILITY

被引：12

作者：

AMIN, AT

HAKIMI, SL

机构：

[1] NORTHWESTERN UNIV,DEPT COMP SCI,EVANSTON,IL 60201

[2] NORTHWESTERN UNIV,DEPT ELECT ENGN,EVANSTON,IL 60201

来源：

IEEE TRANSACTIONS ON CIRCUIT THEORY | 1973年 / CT20卷 / 01期

关键词：

D O I：

10.1109/TCT.1973.1083622

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：2 / 10

页数：9

共 17 条

[1]

AMIN AT, 1972, THESIS NORTHWESTERN

[2]

BOESCH F, 1970, IEEE T, VCT17, P183

[3] INVULNERABILITY OF REGULAR COMPLETE K-PARTITE GRAPHS [J].

BOESCH, FT ;

FELZER, A .

[4] On colouring the nodes of a network [J].

Brooks, RL .

PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 :194-197

[5]

DESLER JF, 1970, 4TH P ANN PRINC C IN, P459

[6]

Ford Lester R., 1962, FLOWS NETWORKS

[7]

FRANK H, 1969, MAXIMALLY SURVIVABLE

[8] AN ALGORITHM FOR VERTEX-PAIR CONNECTIVITY [J].

FRISCH, IT .

[9]

HAKIMI SL, 1969, IEEE T CIRCUIT THEOR, VCT16, P229

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

HARARY, F .