On the generalized (edge-)connectivity of graphs
From MaRDI portal
Publication:2876013
zbMath1296.05107arXiv1112.0127MaRDI QIDQ2876013
Yuefang Sun, Yaping Mao, Xue Liang Li
Publication date: 15 August 2014
Full work available at URL: https://arxiv.org/abs/1112.0127
Related Items (32)
On the maximum and minimum sizes of a graph with given \(k\)-connectivity ⋮ Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs ⋮ 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 ⋮ Path 3-(edge-)connectivity of lexicographic product graphs ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph ⋮ On two generalized connectivities of graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ The 4-set tree connectivity of \((n, k)\)-star networks ⋮ The minimum size of a graph with given tree connectivity ⋮ The generalized 3-connectivity of graph products ⋮ \(k\)-tree connectivity of line graphs ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ Tree connectivities of Cayley graphs on abelian groups with small degrees ⋮ A solution to a conjecture on the generalized connectivity of graphs ⋮ On the difference of two generalized connectivities of a graph ⋮ Steiner tree packing number and tree connectivity ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ The generalized connectivity of the line graph and the total graph for the complete bipartite graph ⋮ On extremal graphs with exactly one Steiner tree connecting any $k$ vertices ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Generalized connectivity of some total graphs ⋮ Separation of Cartesian products of graphs into several connected components by the removal of edges ⋮ Generalized 3-(edge)-connectivity for undirected double-loop networks ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs ⋮ Generalized 3-edge-connectivity of Cartesian product graphs ⋮ Two lower bounds for generalized 3-connectivity of Cartesian product graphs ⋮ Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs ⋮ Extremal results for directed tree connectivity
This page was built for publication: On the generalized (edge-)connectivity of graphs
