^-optimality of bipartite digraphs

DOI10.1016/J.IPL.2012.05.003MaRDI QIDQ456094zbMATH OpenOpenAlexFDO

Authors Xing Chen, Juan Liu, Jixiang 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

zbMATH Keywords

\(\lambda^{\prime}\)-optimalbipartite digraphfault tolerancerestricted arc-connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• \(\lambda ^{\prime}\)-optimal digraphs
• scientific article; zbMATH DE number 6672459
• Restricted arc-connectivity of digraphs.
• On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs
• Restricted arc-connectivity of bipartite tournaments

Cites work

• \(\lambda ^{\prime}\)-optimal 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
• On computing a conditional edge-connectivity of a graph
• On restricted edge-connectivity of graphs.
• On the restricted arc-connectivity of \(s\)-geodetic digraphs
• On the super-restricted arc-connectivity of s-geodetic digraphs
• Restricted arc-connectivity of digraphs
• Restricted arc-connectivity of generalized tournaments
• Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
• Sufficient conditions for '-optimality in graphs of diameter 2
• Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
• Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
• Sufficient conditions for restricted-edge-connectivity to be optimal
• Sufficient conditions for λ′‐optimality in graphs with girth g
• The restricted arc connectivity of Cartesian product digraphs

Cited in

(11)

• 3-restricted arc connectivity of digraphs
• On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs
• Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
• Restricted arc-connectivity of digraphs
• Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes
• Restricted arc-connectivity of bipartite tournaments
• Asymptotically optimal (, D', s)-digraphs
• Restricted arc-connectivity of digraphs.
• Degree sum conditions for optimal 3-restricted arc-connected digraphs
• On the restricted arc-connectivity of oriented graphs
• \(\lambda ^{\prime}\)-optimal digraphs

This page was built for publication: \(\lambda^{\prime}\)-optimality of bipartite digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456094)