The connected cutset connectivity of a graph
The connected (edge-)cutset connectivity \(c\kappa\) (G) \((c\kappa_ 1(G))\) of a graph G is the minimum cardinality of a vertex (edge) cutset S of G such that the subgraph induced by S is connected. Let \(\kappa\) (G) be the vertex-connectivity of G, \(\kappa_ 1(G)\) the edge-connectivity and \(\delta\) (G) the minimal degree. The author proves existence theorems for graphs with given \(\kappa\) (G), \(c\kappa\) (G), \(\delta\) (G) as well as given \(\kappa_ 1(G)\), \(c\kappa_ 1(G)\), \(\delta\) (G) and shows that for graphs with \(c\kappa_ 1(G)\subseteq c\kappa (G)\) holds \(c\kappa_ 1(G)=\delta (G)\).
- A Graph-Theoretic Approach to a Communications Problem
- A sufficient condition for equality of edge-connectivity and minimum degree of a graph
- Critically n-Connected Graphs
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 3497930 (Why is no real title available?)
- On graphs with equal edge-connectivity and minimum degree
- Results on the edge-connectivity of graphs
- Minimal separating sets of maximum size
- Non-separable detachments of graphs
- Connectivity parameters of graphs
- Graphs with the smallest number of minimum cut sets
- scientific article; zbMATH DE number 5161490 (Why is no real title available?)
- scientific article; zbMATH DE number 3970793 (Why is no real title available?)
- scientific article; zbMATH DE number 759641 (Why is no real title available?)
- scientific article; zbMATH DE number 5938876 (Why is no real title available?)
- Computation in causal graphs
- The Set Connector Problem in Graphs
- Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
- The structure of 2-matching connected graphs
- High connectivity keeping sets in \(n\)-connected graphs
This page was built for publication: The connected cutset connectivity of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101465)
