On graphs with equal edge-connectivity and minimum degree

DOI10.1016/0012-365X(78)90184-XzbMath0393.05035MaRDI QIDQ1252356

Arthur T. White, Donald L. Goldsmith

Publication date: 1978

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

zbMATH Keywords

Edge ConnectivityGraphs with Equal Edge-ConnectivityMinimum Degree

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (14)

A sufficient condition for equality of arc-connectivity and minimum degree of a digraph ⋮ Neighborhood and degree conditions for super-edge-connected bipartite digraphs ⋮ The connected cutset connectivity of a graph ⋮ 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 ⋮ On graphs with equal edge connectivity and minimum degree ⋮ Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs ⋮ Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\) ⋮ Graphs and degree sequences. I ⋮ 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 ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)

Cites Work

• Results on the edge-connectivity of graphs
• A Graph-Theoretic Approach to a Communications Problem

This page was built for publication: On graphs with equal edge-connectivity and minimum degree