Abstract
An upper bound on the saturation number for graphs as well as associated extremal graphs was given by (Kászonyi and Tuza in J. Graph Theory, 10:203–210, 1986). A minor improvement of that result, which was implied in their paper, will be stated. Using this result, a series of exact saturation numbers and associated extremal graphs will be proved for the nearly complete graphs K t − E(L), where L is a graph of order at most 4.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chartrand G., Lesniak L.: Graphs and Digraphs. Chapman and Hall, London (2005)
Chen, G., Guantao, Faudree, R.J., Gould, R.J.: Saturation numbers of books. Electron. J. Combin. 15 (2008)
Erdős P., Hajnal A., Moon J.W.: A problem in graph theory. Am. Math. Monthly 71, 1107–1110 (1964)
Faudree, J.R., Faudree, R.J., Gould, R.J., Jacobson, M.S.: Saturation numbers for trees. Electron. J. Combin. 16 (2009)
Kászonyi L., Tuza Z.: Saturated graphs with minimal number of edges. J. Graph Theory 10, 203–210 (1986)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Faudree, R.J., Gould, R.J. Saturation Numbers for Nearly Complete Graphs. Graphs and Combinatorics 29, 429–448 (2013). https://doi.org/10.1007/s00373-011-1128-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-011-1128-9