On the maximum and minimum sizes of a graph with given \(k\)-connectivity

DOI10.7151/dmgt.1941zbMath1366.05058OpenAlexW2560040948MaRDI QIDQ2364084

Yanyan Li

Publication date: 17 July 2017

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

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

zbMATH Keywords

connectivity\(k\)-connectivitygeneralized connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (4)

Separation of Cartesian products of graphs into several connected components by the removal of vertices ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ On two generalized connectivities of graphs ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp upper bounds for generalized edge-connectivity of product graphs
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• On the difference of two generalized connectivities of a graph
• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
• On the \(\ell\)-connectivity of a graph
• On two generalized connectivities of graphs
• A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
• 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 maximum and minimum sizes of a graph with given \(k\)-connectivity