Geodesic
On the Maximum and Minimum Sizes of a Graph with Given k-Connectivity
Discussiones Mathematicae. Graph Theory, Tome 37 (2017) no. 3, pp. 623-632

Voir la notice de l'article provenant de la source Library of Science

The concept of k-connectivity κk(G), introduced by Chartrand in 1984, is a generalization of the cut-version of the classical connectivity. For an integer k ≥ 2, the k-connectivity of a connected graph G with order n ≥ k is the smallest number of vertices whose removal from G produces a graph with at least k components or a graph with fewer than k vertices. In this paper, we get a sharp upper bound for the size of G with κk(G) = t, where 1 ≤ t ≤ n − k and k ≥ 3; moreover, the unique extremal graph is given. Based on this result, we get the exact values for the maximum size, denoted by g(n, k, t), of a connected graph G with order n and κk(G) = t. We also compute the exact values and bounds for another parameter f(n, k, t) which is defined as the minimum size of a connected graph G with order n and κk(G) = t, where 1 ≤ t ≤ n − k and k ≥ 3.
Keywords: k -connectivity, generalized connectivity, connectivity 
@article{DMGT_2017_37_3_a9,
     author = {Sun, Yuefang},
     title = {On the {Maximum} and {Minimum} {Sizes} of a {Graph} with {Given} {k-Connectivity}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {623--632},
     publisher = {mathdoc},
     volume = {37},
     number = {3},
     year = {2017},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2017_37_3_a9/}
}
TY  - JOUR
AU  - Sun, Yuefang
TI  - On the Maximum and Minimum Sizes of a Graph with Given k-Connectivity
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2017
SP  - 623
EP  - 632
VL  - 37
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2017_37_3_a9/
LA  - en
ID  - DMGT_2017_37_3_a9
ER  - 
%0 Journal Article
%A Sun, Yuefang
%T On the Maximum and Minimum Sizes of a Graph with Given k-Connectivity
%J Discussiones Mathematicae. Graph Theory
%D 2017
%P 623-632
%V 37
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2017_37_3_a9/
%G en
%F DMGT_2017_37_3_a9
Sun, Yuefang. On the Maximum and Minimum Sizes of a Graph with Given k-Connectivity. Discussiones Mathematicae. Graph Theory, Tome 37 (2017) no. 3, pp. 623-632. http://geodesic.mathdoc.fr/item/DMGT_2017_37_3_a9/