The minimum size of a graph with given tree connectivity

DOI10.7151/DMGT.2193MaRDI QIDQ2227103zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 10 February 2021

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2193

zbMATH Keywords

packinggeneralized connectivitytree connectivitygeneralized \(k\)-connectivitygeneralized \(k\)-edge-connectivity

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The minimal size of a graph with generalized connectivity \(\kappa_3=2\)
• Note on the generalized connectivity.
• The minimal size of a graph with given generalized 3-edge-connectivity.
• On the maximum and minimum sizes of a graph with given \(k\)-connectivity
• On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)

Cites work

• scientific article; zbMATH DE number 2209521 (Why is no real title available?)
• A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
• A solution to a conjecture on the generalized connectivity of graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Generalized 3-edge-connectivity of Cartesian product graphs.
• Generalized Connectivity of Graphs
• Graph theory
• Graphs with large generalized (edge-)connectivity
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
• Note on the generalized connectivity.
• Note on the spanning-tree packing number of lexicographic product graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• On the difference of two generalized connectivities of a graph
• On the generalized (edge-)connectivity of graphs
• On the spanning tree packing number of a graph: A survey
• Packing Steiner trees: A cutting plane algorithm and computational results
• Pendant tree-connectivity
• Rainbow trees in graphs and generalized connectivity
• Sharp upper bounds for generalized edge-connectivity of product graphs
• Spanning trees: A survey
• Steiner minimal trees
• Steiner tree problems in computer communication networks.
• The Steiner tree packing problem in VLSI design
• The generalized 3-connectivity of Cartesian product
• The generalized 3-connectivity of lexicographic product graphs
• The minimal size of a graph with given generalized 3-edge-connectivity.
• Tree connectivities of Cayley graphs on abelian groups with small degrees

Cited in

(13)

• On the minimum size of graphs with given generalized connectivity
• scientific article; zbMATH DE number 165095 (Why is no real title available?)
• On extremal graphs with internally disjoint Steiner trees
• The minimal size of a graph with given generalized 3-edge-connectivity.
• The minimal size of a graph with generalized connectivity \(\kappa_3=2\)
• On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices
• Minimum degree and minimum number of edge-disjoint trees
• \(k\)-tree connectivity of line graphs
• On extremal graphs with exactly one Steiner tree connecting any \(k\) vertices
• Two-tree graphs with minimum sum-connectivity index
• The tree connectivity of regular complete bipartite graphs
• Note on the generalized connectivity.
• On the maximum and minimum sizes of a graph with given \(k\)-connectivity

This page was built for publication: The minimum size of a graph with given tree connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227103)