×

Bounds on the size of graphs of given order and \(l\)-connectivity. (English) Zbl 0927.05051

The \(l\)-connectivity of a graph \(G\) of order \(p\) is the minimum number of vertices that have to be deleted from \(G\) to obtain a graph with at least \(l\) components or with fewer than \(l\) vertices. The authors provide bounds on the size of a graph of given order and \(l\)-connectivity.
Reviewer: P.Horák (Safat)

MSC:

05C40 Connectivity
05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bauer, D.; Schmeichel, E.; Veldman, H. J.: Some recent results on long cycles in tough graphs in: graph theory. Combinatorics and applications, 113-123 (1991) · Zbl 0840.05049
[2] Chartrand, G.; Kapoor, S. F.; Lesniak, L.; Lick, D. R.: Generalized connectivity in graphs. Bull. bombay math. Colloq. 2, 1-6 (1984) · Zbl 0545.05052
[3] Chartrand, G.; Lesniak, L.: Graphs and digraphs. (1986) · Zbl 0666.05001
[4] Chvátal, V.: Tough graphs and Hamilton circuits. Discrete math. 5, 215-228 (1973) · Zbl 0256.05122
[5] Goddard, W. D.; Swart, Henda C.: On the toughness of a graph. Quaestiones math. 13, 217-232 (1990) · Zbl 0708.05035
[6] Harary, F.: The maximum connectivity of a graph. Proc. nat. Acad. sci. USA 48, 1142-1146 (1962) · Zbl 0115.41003
[7] Oellermann, O. R.: On the \ell-connectivity of a graph. Graphs combin. 3, 285-291 (1987) · Zbl 0631.05031
[8] Pippert, R. E.: On the toughness of a graph. Lecture notes in mathematics 303, 225-233 (1972) · Zbl 0249.05129
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.