On graphs with equal edge-connectivity and minimum degree

DOI10.1016/0012-365X(78)90184-XMaRDI QIDQ1252356zbMATH OpenFDO

Authors Donald L. Goldsmith, Arthur T. White

Publication date 1978

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(78)90184-X

zbMATH Keywords

Edge ConnectivityGraphs with Equal Edge-ConnectivityMinimum Degree

Mathematics Subject Classification ID

Connectivity (05C40)

Cites work

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

Cited in

(16)

• The connected cutset connectivity of a graph
• On graphs with equal edge connectivity and minimum degree
• A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
• Neighborhood and degree conditions for super-edge-connected bipartite digraphs
• Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
• Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
• Sufficient conditions for restricted-edge-connectivity to be optimal
• Local-edge-connectivity in digraphs and oriented graphs
• Graphs and degree sequences. I
• Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
• Maximally edge-connected graphs and zeroth-order general Randić index for -1
• Maximally edge‐connected realizations and Kundu's k k‐factor theorem
• On the size of linear r-uniform hypergraphs and sufficient conditions for maximally edge-connected hypergraphs
• On the maximal edge-connectedness of the third power graph
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey

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

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