Restricted edge connectivity of regular graphs
An edge cut which separates a connected graph into parts with order at least 2 is called restricted edge cut. A graph \(G\) is called maximal restricted edge connected if the restricted edge connectivity number (the cardinality of a minimum restricted edge cut) of \(G\) equals the minimum edge degree; see \textit{A.-H. Esfahanian} and \textit{S. L. Hakimi} [Inf. Process. Lett. 27, 195-199 (1988; Zbl 0633.05045)]. Here the author proves that every \(k\)-regular graph with \(k\geq 2\) and \(|G|\geq 4\) is maximal restricted edge connected if \(2k>|G|\).
- Super restricted edge connectivity of regular graphs
- On maximal 3-restricted edge connectivity of regular graphs
- Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected
- Bound on m-restricted edge connectivity
- Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
- Bound on m-restricted edge connectivity
- Some results on \(R_2\)-edge-connectivity of even regular graphs
- Super restricted edge connectivity of regular graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Restrict edge-connectivity of circular graphs
- Super restricted edge connectivity of regular edge-transitive graphs
- scientific article; zbMATH DE number 1933044 (Why is no real title available?)
- Sufficient conditions for maximally restricted edge connected graphs
- scientific article; zbMATH DE number 2197917 (Why is no real title available?)
- scientific article; zbMATH DE number 5064073 (Why is no real title available?)
- On restricted edge-connectivity of graphs.
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
This page was built for publication: Restricted edge connectivity of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778142)
