Diameter-vulnerability of large bipartite digraphs
From MaRDI portal
Publication:1917252
DOI10.1016/0166-218X(94)00127-YzbMath0851.05055WikidataQ63958690 ScholiaQ63958690MaRDI QIDQ1917252
E. Llobet, Carles Padró, Paz Morillo
Publication date: 21 November 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Diameter vulnerability of iterated line digraphs ⋮ Super link-connectivity of iterated line digraphs. ⋮ On large (Δ, D, D, 1)-graphs ⋮ Disjoint paths of bounded length in large generalized cycles
Cites Work
- Large fault-tolerant interconnection networks
- The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
- Large \((d,D, D',s)\)-bipartite digraphs
- On the linegraph of a directed-graph
- Line Digraph Iterations and the (d, k) Digraph Problem
- Dense bipartite digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Diameter-vulnerability of large bipartite digraphs