The minimal size of a graph with given generalized 3-edge-connectivity

zbMath1349.05093arXiv1201.3699MaRDI QIDQ2804745

Yaping Mao, Xue Liang Li

Publication date: 4 May 2016

Full work available at URL: https://arxiv.org/abs/1201.3699

zbMATH Keywords

Steiner treeedge connectivityedge-disjoint treesgeneralized edge connectivity

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Connectivity (05C40)

Related Items (7)

Graphs with large generalized (edge-)connectivity ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ The minimum size of a graph with given tree connectivity ⋮ A solution to a conjecture on the generalized connectivity of graphs ⋮ The generalized connectivity of the line graph and the total graph for the complete bipartite graph ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs

This page was built for publication: The minimal size of a graph with given generalized 3-edge-connectivity