Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter

DOI10.1016/0166-218X(90)90069-OzbMath0707.05027MaRDI QIDQ918987

Terunao Soneoka, Hiroshi Nakada, Makoto Imase

Publication date: 1990

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

zbMATH Keywords

d-connected digraphd-regular digraph

Mathematics Subject Classification ID

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

Related Items (8)

An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs ⋮ Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II ⋮ Large fault-tolerant interconnection networks ⋮ Robustness and Strong Attack Tolerance of Low-Diameter Networks ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Connectivity of consecutive-\(d\) digraphs ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks

Cites Work

• Unnamed Item
• Unnamed Item
• Large fault-tolerant interconnection networks
• Connectivity of Regular Directed Graphs with Small Diameters
• An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
• Design to Minimize Diameter on Building-Block Network

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