Diameter-vulnerability of large bipartite digraphs
From MaRDI portal
Recommendations
- Diameter vulnerability of graphs
- On the diameter vulnerability of Kautz digraphs
- Diameter vulnerability of iterated line digraphs
- Diameter vulnerability of iterated line digraphs in terms of the girth
- Diameter vulnerability of graphs by edge deletion
- Vulnerability in graphs of diameter four
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Line digraph iterations and diameter vulnerability
- New bounds on the diameter vulnerability of iterated line digraphs
- Diameters of random bipartite graphs
Cites work
- scientific article; zbMATH DE number 3831957 (Why is no real title available?)
- scientific article; zbMATH DE number 3908346 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 4108811 (Why is no real title available?)
- scientific article; zbMATH DE number 4110714 (Why is no real title available?)
- Dense bipartite digraphs
- Large (d,D, D',s)-bipartite digraphs
- Large fault-tolerant interconnection networks
- Line Digraph Iterations and the (d, k) Digraph Problem
- On the linegraph of a directed-graph
- The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
Cited in
(7)- Diameter vulnerability of iterated line digraphs in terms of the girth
- Large (d,D, D',s)-bipartite digraphs
- Disjoint paths of bounded length in large generalized cycles
- New bounds on the diameter vulnerability of iterated line digraphs
- Super link-connectivity of iterated line digraphs.
- Diameter vulnerability of iterated line digraphs
- On large \((\Delta , D, D, 1)\)-graphs
This page was built for publication: Diameter-vulnerability of large bipartite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917252)
