A sufficient condition for equality of arc-connectivity and minimum degree of a digraph

DOI10.1016/0012-365X(94)90040-XzbMath0808.05068OpenAlexW2050192535MaRDI QIDQ1336715

Jun-Ming Xu

Publication date: 9 March 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90040-x

zbMATH Keywords

in-degreeout-degreesimple digraphstrong arc-connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (7)

Neighborhood and degree conditions for super-edge-connected bipartite digraphs ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\) ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Local-edge-connectivity in digraphs and oriented graphs ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\) ⋮ Degree sequence conditions for maximally edge-connected oriented graphs ⋮ Inverse degree and edge-connectivity

Cites Work

• On graphs with equal edge-connectivity and minimum degree

This page was built for publication: A sufficient condition for equality of arc-connectivity and minimum degree of a digraph