\(\lambda^{\prime}\)-optimality of bipartite digraphs
From MaRDI portal
Publication:456094
DOI10.1016/J.IPL.2012.05.003zbMath1248.68104OpenAlexW1989192916MaRDI QIDQ456094
Juan Liu, Xing Chen, Ji Xiang Meng
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.05.003
Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (4)
Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes ⋮ 3-restricted arc connectivity of digraphs ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments ⋮ On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs
Cites Work
- On the restricted arc-connectivity of \(s\)-geodetic digraphs
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- \(\lambda ^{\prime}\)-optimal digraphs
- The restricted arc connectivity of Cartesian product digraphs
- Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
- On computing a conditional edge-connectivity of a graph
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Restricted arc-connectivity of digraphs
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- On the super‐restricted arc‐connectivity of s ‐geodetic digraphs
- Sufficient conditions for λ′‐optimality in graphs with girth g
- On restricted edge-connectivity of graphs.
- Unnamed Item
This page was built for publication: \(\lambda^{\prime}\)-optimality of bipartite digraphs
