SURVEY OF THE THEORY OF HYPERCUBE GRAPHS.

被引：0

作者：

Harary, Frank ^{[1
]}

Hayes, John P. ^{[1
]}

Wu, Horng-Jyh ^{[1
]}

机构：

[1] New Mexico State Univ, Las Cruces,, NM, USA, New Mexico State Univ, Las Cruces, NM, USA

来源：

Computers & mathematics with applications | 1986年 / 15卷 / 04期

关键词：

Acknowledgements--This work was supported in part by the Office of Naval Research under Contract No. N0014 85 K 0531;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：277 / 289

共 50 条

[31] AUTOMATIC DESIGN WITH DEPENDENCE GRAPHS.
Casavant, A.E.
Gajski, D.D.
Kuck, D.J.
Jahrbuch der Schiffbautechnischen Gesellschaft, 1980, : 506 - 515
[32] DEPTH PROBLEMS FOR FLOW GRAPHS.
Hirata, Tomio
Maruoka, Akira
Kimura, Masayuki
Systems, computers, controls, 1979, 10 (06): : 78 - 85
[33] NODE-GRACEFUL GRAPHS.
Harary, Frank
Hsu, D.Frank
Computers & mathematics with applications, 1986, 15 (04): : 291 - 298
[34] CONNECTIONIST NETWORKS QUA GRAPHS.
Partridge, D.
Computers & mathematics with applications, 1986, 15 (04): : 325 - 331
[35] Cuts in Undirected Graphs. II
F. Sharifov
L. Hulianytskyi
Cybernetics and Systems Analysis, 2020, 56 : 745 - 752
[36] The cubicity of hypercube graphs
Chandran, L. Sunil
Sivadasan, Naveen
DISCRETE MATHEMATICS, 2008, 308 (23) : 5795 - 5800
[37] COPS AND ROBBERS IN GRAPHS WITH LARGE GIRTH AND CAYLEY GRAPHS.
Frankl, Peter
1600, (17):
[38] Parallel community detection for massive graphs.
Riedy, E. Jason
Meyerhenke, Henning
Ediger, David
Bader, David A.
GRAPH PARTITIONING AND GRAPH CLUSTERING, 2013, 588 : 207 - +
[39] Virtual screening using reduced graphs.
Gillet, VJ
ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2004, 228 : U362 - U363
[40] Summing all the eikonal graphs. II
H. M. Fried
Y. Gabellini
The European Physical Journal C - Particles and Fields, 2003, 32 : 55 - 65