SUFFICIENT CONDITIONS FOR MAXIMALLY CONNECTED DENSE GRAPHS

被引：66

作者：

SONEOKA, T ^{[1
]}

NAKADA, H ^{[1
]}

IMASE, M ^{[1
]}

PEYRAT, C ^{[1
]}

机构：

[1] UNIV PARIS 11, CNRS, RECH INFORMAT LAB, F-91405 ORSAY, FRANCE

来源：

DISCRETE MATHEMATICS | 1987年 / 63卷 / 01期

关键词：

D O I：

10.1016/0012-365X(87)90151-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：53 / 66

页数：14

共 15 条

[1] TABLES OF LARGE GRAPHS WITH GIVEN DEGREE AND DIAMETER [J].

BERMOND, JC ;

DELORME, C ;

QUISQUATER, JJ .

INFORMATION PROCESSING LETTERS, 1982, 15 (01) :10-13

[2] LARGE GRAPHS WITH GIVEN DEGREE AND DIAMETER .2. [J].

BERMOND, JC ;

DELORME, C ;

FARHI, G .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 36 (01) :32-48

[3]

BERMOND JC, 1985, UNPUB J PARALLEL DIS

[4]

BOLLOBAS B, 1978, LONDON MATH SOC MONO, V11

[5]

De Bruijn N. G., 1946, P KONINKLIJKE NEDERL, V49, P758

[6] LOWER-BOUNDS ON THE CONNECTIVITIES OF A GRAPH [J].

ESFAHANIAN, AH .

JOURNAL OF GRAPH THEORY, 1985, 9 (04) :503-511

[7]

Fiol M. A., 1983, 10th Annual International Conference on Computer Architecture Conference Proceedings, P174, DOI 10.1145/800046.801653

[8]

HOMOBONO N, 1985, CONNEXITE GRAPHES KA

[9]

IMASE M, 1985, IEEE T COMPUT, V34, P267, DOI 10.1109/TC.1985.1676569

[10]

IMASE M, 1983, IEEE T COMPUT, V32, P782, DOI 10.1109/TC.1983.1676323

← 1 2 →