On the minimum size of graphs with given generalized connectivity

DOI10.1016/j.dam.2024.04.027zbMath1545.05126MaRDI QIDQ6559394

Shu-Li Zhao, Hengzhe Li, Jou-Ming Chang

Publication date: 21 June 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

reliabilityconnectivityfault tolerancegeneralized connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Mathematical programming (90C99)

Cites Work

• Unnamed Item
• Unnamed Item
• A solution to a conjecture on the generalized connectivity of graphs
• Congruent graphs and the connectivity of graphs
• Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
• Pendant tree-connectivity
• Note on the hardness of generalized connectivity
• The generalized 4-connectivity of pancake graphs
• The minimum size of a graph with given tree connectivity
• Reliability assessment of the divide-and-swap cube in terms of generalized connectivity
• The minimal size of a graph with given generalized 3-edge-connectivity
• On the generalized (edge-)connectivity of graphs
• Generalized Connectivity of Graphs
• Rainbow trees in graphs and generalized connectivity
• The minimal size of a graph with generalized connectivity $\kappa_3 = 2$
• The generalized 4-connectivity of locally twisted cubes

This page was built for publication: On the minimum size of graphs with given generalized connectivity