MAXIMALLY CONNECTED DIGRAPHS

被引：111

作者：

FABREGA, J

FIOL, MA

机构：

来源：

JOURNAL OF GRAPH THEORY | 1989年 / 13卷 / 06期

关键词：

D O I：

10.1002/jgt.3190130603

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：657 / 668

页数：12

共 20 条

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

ALEGRE, I ;

FIOL, MA ;

YEBRA, JLA .

JOURNAL OF GRAPH THEORY, 1986, 10 (02) :219-224

[2] STRATEGIES FOR INTERCONNECTION NETWORKS - SOME METHODS FROM GRAPH-THEORY [J].

BERMOND, JC ;

DELORME, C ;

QUISQUATER, JJ .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1986, 3 (04) :433-449

[3] LARGE FAULT-TOLERANT INTERCONNECTION NETWORKS [J].

BERMOND, JC ;

HOMOBONO, N ;

PEYRAT, C .

GRAPHS AND COMBINATORICS, 1989, 5 (02) :107-123

[4]

BERMOND JC, 1983, LONDON MATH SOC LECT, V82, P1

[5]

BIGGS N, 1974, CTM67

[6]

BOECH F, 1984, J GRAPH THEOR, V8, P487

[7]

Chartrand G., 2016, GRAPHS DIGRAPHS, V6th, DOI 10.1201/b19731

[8]

Fabrega J., 1985, 3 P IAESTED INT S AP, P45

[9]

FIOL MA, 1984, IEEE T COMPUT, V33, P400, DOI 10.1109/TC.1984.1676455

[10]

Geller D., 1970, LECT NOTES MATH, V186, P105

← 1 2 →