ON GRAPHS WITH RANDOMLY DELETED EDGES

被引：72

作者：

KELMANS, AK

机构：

来源：

ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE | 1981年 / 37卷 / 1-3期

关键词：

D O I：

10.1007/BF01904874

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：77 / 88

页数：12

共 20 条

[1]

ERDOS P, 1960, B INT STATIST INST, V38, P343

[2] ANALYSIS AND DESIGN OF SURVIVABLE NETWORKS [J].

FRANK, H ;

FRISCH, IT .

IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1970, CO18 (05) :501-&

[3]

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

[4]

Kelmans A.K., 1967, CYBERNETICS SERVICE, V4, P27

[5]

KELMANS AK, 1972, TEOR VER PRIM, V17, P253

[6] GRAPHS WITH AN EXTREMAL NUMBER OF SPANNING-TREES [J].

KELMANS, AK .

[7] COMPARISON OF GRAPHS BY THEIR NUMBER OF SPANNING TREES [J].

KELMANS, AK .

[8]

KELMANS AK, 1975, NADEZNOST STABILNOST, P3

[9]

Kelmans AK., 1966, AUTOMAT REM CONTR+, V27, P56

[10]

KELMANS AK, 1967, AVTOMAT TELEMEKH, V28, P98