Maximally connected digraphs
- 1 December 1989
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 13 (6) , 657-668
- https://doi.org/10.1002/jgt.3190130603
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Large fault-tolerant interconnection networksGraphs and Combinatorics, 1989
- Connectivity of Imase and Itoh digraphsIEEE Transactions on Computers, 1988
- Strategies for interconnection networks: Some methods from graph theoryJournal of Parallel and Distributed Computing, 1986
- Some large graphs with given degree and diameterJournal of Graph Theory, 1986
- Connectivity of Regular Directed Graphs with Small DiametersIEEE Transactions on Computers, 1985
- Circulants and their connectivitiesJournal of Graph Theory, 1984
- Line Digraph Iterations and the (d, k) Digraph ProblemIEEE Transactions on Computers, 1984
- A Design for Directed Graphs with Minimum DiameterIEEE Transactions on Computers, 1983
- Design to Minimize Diameter on Building-Block NetworkIEEE Transactions on Computers, 1981
- Algebraic Graph TheoryPublished by Cambridge University Press (CUP) ,1974