On the difference of two generalized connectivities of a graph
From MaRDI portal
Publication:512888
DOI10.1007/s10878-015-9956-9zbMath1358.05167OpenAlexW2178615286MaRDI QIDQ512888
Publication date: 3 March 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9956-9
Related Items (11)
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 ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ On two generalized connectivities of graphs ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes ⋮ The minimum size of a graph with given tree connectivity ⋮ The 4-component connectivity of alternating group networks ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs ⋮ Generalized 4-connectivity of hierarchical star networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tree connectivities of Cayley graphs on abelian groups with small degrees
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- Pendant tree-connectivity
- On the \(\ell\)-connectivity of a graph
- Generalized 3-(edge)-connectivity for undirected double-loop networks
- On the generalized (edge-)connectivity of graphs
- Rainbow trees in graphs and generalized connectivity
- Graphs with large generalized 3-connectivity
- The generalized 3-connectivity of Lexicographic product graphs
- Generalized 3-edge-connectivity of Cartesian product graphs
- The generalized 3-connectivity of Cartesian product graphs
- The generalized 3-connectivity of random graphs
This page was built for publication: On the difference of two generalized connectivities of a graph