scientific article; zbMATH DE number 1062587

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-J" /><27::AID-JGT4>3.0.CO;2-J 10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-JzbMath0879.05049MaRDI QIDQ4355069

Peter Dankelmann, Lutz Volkmann

Publication date: 22 December 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bipartitegraphdigraphminimum degreeedge-connectivitydegree sequence

Mathematics Subject Classification ID

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

Related Items (17)

Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) ⋮ Neighborhood and degree conditions for super-edge-connected bipartite digraphs ⋮ On the edge-connectivity of C_4-free graphs ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal ⋮ Super Edge-Connected Linear Hypergraphs ⋮ Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs ⋮ Super edge-connectivity and zeroth-order Randić index ⋮ On optimizing edge connectivity of product graphs ⋮ 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 ⋮ Sufficient conditions for restricted-edge-connectivity to be optimal ⋮ Local-edge-connectivity in digraphs and oriented graphs ⋮ Super-edge-connectivity and zeroth-order Randić index ⋮ 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

This page was built for publication: