Large (d,D, D',s)-bipartite digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3908346 (Why is no real title available?)
- scientific article; zbMATH DE number 4059445 (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 3993464 (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
(8)- scientific article; zbMATH DE number 4108811 (Why is no real title available?)
- Large vertex symmetric digraphs
- A line digraph of a complete bipartite digraph
- Large (d,D, D',s)-bipartite digraphs
- Diameter-vulnerability of large bipartite digraphs
- On large bipartite graphs of diameter 3
- On large \((\Delta , D, D, 1)\)-graphs
- On Moore bipartite digraphs
This page was built for publication: Large \((d,D, D',s)\)-bipartite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1891920)