Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II

DOI10.1016/0166-218X(94)00113-RzbMath0848.05034OpenAlexW4210509512MaRDI QIDQ1917254

Yoshifumi Manabe, Terunao Soneoka, Makoto Imase

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00113-r

zbMATH Keywords

digraphdiameter

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Large fault-tolerant interconnection networks ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Super edge-connectivity of dense digraphs and graphs

Cites Work

• Unnamed Item
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
• Large fault-tolerant interconnection networks
• Connectivity of consecutive-\(d\) digraphs
• On the impossibility of directed Moore graphs
• Connectivity of Regular Directed Graphs with Small Diameters
• Line Digraph Iterations and the (d, k) Digraph Problem
• An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
• A Design for Directed Graphs with Minimum Diameter
• Generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network
• A synthesis approach to design optimally fault tolerant network architecture

This page was built for publication: Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II