Abstract
For a fixed graph F, a graph G is F-saturated if it has no F as a subgraph, but does contain F after the addition of any new edge. The saturation number, sat(n, F), is the minimum number of edges of a graph in the set of all F-saturated graphs with order n. In this paper, we determine the saturation number sat(n,2P3 ∪ tP2) and characterize the extremal graphs for n ⩾ 6t + 8.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bondy J A, Murty U S R. Graph Theory with Applications[M]. New York: Elsevier, 1976.
Turan P. Eine extremalaufgabe aus der graphentheorie[J]. Mat Fiz Lapok, 1941, 48: 436–452.
Erdös P, Hajnal A, Moon J W. A problem in graph theory[J]. Am Math Mon, 1964, 71: 1107–1110.
Kászonyi L, Tuza Z. Saturated graphs with minimal number of edges[J]. J Graph Theory, 1986, 10: 203–210.
Bohman T, Fonoberova M, Pikhurko O. The saturation function of complete partite graphs [J]. J Comb, 2010, 1: 149–170.
Faudree J R, Ferrara M, Gould R J, et al. tKp-saturated graphs of minimum size [J]. Discret Math, 2009, 309(19): 5870–5876.
Faudree R J, Gould R J. Saturation numbers for nearly complete graphs[J]. Graphs Comb, 2013, 29: 429–448.
Bolloƀas B. On a conjecture of Erdos, Hajnal and Moon [J]. Am Math, 1967, 74: 178–179.
Chen Y. Minimum C5-saturated graphs [J]. J Graph Theory, 2009, 61(2): 111–126.
Chen Y. All minimum C5-saturated graphs [J]. J Graph Theory, 2011, 67(1): 9–26.
Tuza Z. C4-saturated graphs of minimum size[J]. Acta Univ Carolin Math Phy, 1989, 30(2): 161–167.
Zhang M, Luo S, Shigeno M. On the number of edges in a minimum C6-saturated graph[J]. Graphs Comb, 2015, 31: 1085–1106.
Chen G, Faudree R J, Gould R J. Saturation numbers of books[J]. Electron J Comb, 2008, 15(1): 118–129.
Faudree J R, Faudree R J, Gould R J, et al. Saturation numbers for trees[J]. Electron J Comb, 2009, 16(1): 91–109.
Chen G, Faudree J R, Faudree R J, et al. Results and problems on saturation numbers for linear forests[J]. Bull Inst Comb Appl, 2015, 75: 29–46.
Faudree J R, Faudree R J, Schmitt J R. A survey of minimum saturation graphs[J]. Electron J Comb, 2011, 18: DS19.
Bushaw N, Kettle N. Turn of multiple of paths and equibipartite forests[J]. Comb Probab Comput, 2011, 20: 837–853.
Berge C. Sur le couplage maximum d’un graph[J]. C R Acad Sci Paris, 1958, 247: 258–259.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (11071096, 11171129), the Natural Science Foundation of Hubei Province (2016CFB146), and Research Foundation of College of Economics, Northwest University of Political Science and Law (19XYKY07)
Rights and permissions
About this article
Cite this article
Liu, M., Hu, Z. Saturation Number for Linear Forest 2P3 ∪ tP2. Wuhan Univ. J. Nat. Sci. 24, 283–289 (2019). https://doi.org/10.1007/s11859-019-1398-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11859-019-1398-2