On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs

DOI10.7151/DMGT.2259zbMATH Open1485.05092OpenAlexW2989704761MaRDI QIDQ2118230FDOQ2118230

Yaoyao Zhang, Jixiang Meng

Publication date: 22 March 2022

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2259

zbMATH Keywords

networkoptimalitydigraphbipartite digraphrestricted arc-connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40)

Cites Work

• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Restricted arc-connectivity of digraphs
• Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
• Restricted arc-connectivity of generalized \(p\)-cycles
• On the super‐restricted arc‐connectivity of s ‐geodetic digraphs
• \(\lambda ^{\prime}\)-optimal digraphs
• The restricted arc connectivity of Cartesian product digraphs
• \(\lambda^{\prime}\)-optimality of bipartite digraphs
• On the restricted arc-connectivity of \(s\)-geodetic digraphs
• 3-restricted arc connectivity of digraphs
• Restricted arc-connectivity in tournaments
• Restricted arc-connectivity of bipartite tournaments
• Restricted connectivity of total digraph

This page was built for publication: On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs

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