On the \(\ell\)-connectivity of a graph
From MaRDI portal
Publication:1094432
DOI10.1007/BF01788551zbMath0631.05031MaRDI QIDQ1094432
Publication date: 1987
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items (21)
On the maximum and minimum sizes of a graph with given \(k\)-connectivity ⋮ Separation of Cartesian products of graphs into several connected components by the removal of vertices ⋮ Sharp upper bounds for generalized edge-connectivity of product graphs ⋮ Graphs with large generalized (edge-)connectivity ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs ⋮ On two generalized connectivities of graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Characterization of minimally \((2,l)\)-connected graphs ⋮ The 4-component connectivity of alternating group networks ⋮ The \(g\)-component connectivity of graphs ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ On the difference of two generalized connectivities of a graph ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Structural Properties of Generalized Exchanged Hypercubes ⋮ Path-connectivity of lexicographic product graphs ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs ⋮ Bounds on the size of graphs of given order and \(l\)-connectivity ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments ⋮ On the \(l\)-connectivity of a digraph
Cites Work
This page was built for publication: On the \(\ell\)-connectivity of a graph
