A Design for Directed Graphs with Minimum Diameter

1 August 1983

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-32 (8) , 782-784
https://doi.org/10.1109/tc.1983.1676323

Abstract

This paper proposes a simple procedure for the design of small-diameter graphs. It can be used to construct a directed graph whose diameter is less than or equal to that of any previously proposed graph.

Keywords

This publication has 10 references indexed in Scilit:

Design to Minimize Diameter on Building-Block Network
IEEE Transactions on Computers, 1981
On the impossibility of Directed Moore Graphs
Journal of Combinatorial Theory, Series B, 1980
Distributed fault-tolerance for large multiprocessor systems
Published by Association for Computing Machinery (ACM) ,1980
The Design of Small-Diameter Networks by Local Search
IEEE Transactions on Computers, 1979
A Combinatorial Problem Related to Multimodule Memory Organizations
Journal of the ACM, 1974
Optimally Invulnerable Directed Communication Networks
IEEE Transactions on Communications, 1970
On (d, k) Graphs
IEEE Transactions on Electronic Computers, 1967
A Design for (d, k) Graphs
IEEE Transactions on Electronic Computers, 1966
On the Construction of (d, k) Graphs
IEEE Transactions on Electronic Computers, 1965
Topological constraints on interconnection-limited logic
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1964