Weak saturation number for multiple copies of the complete graph with a star removed

作者：Pu, Liqun^*; Cui, Yajuan

来源：Discrete Applied Mathematics, 2016, 204: 216-220.

DOI：10.1016/j.dam.2015.10.028

• Saturated graphs
• Weak saturation
• Multiple copies

Let K-t denote the complete graph with t vertices, and let K-1,K-m (a star with m edges) denote the complete bipartite graph with partite sets of sizes 1 and m. A graph G of order n is weakly F-saturated if G contains no copy of F, and there is an ordering of the edges in E(K-n\G) so that if they are added one at a time, then each edge added creates a new copy of F. In this paper, the weak saturation number of multiple copies of K-t - K-1,K-m is determined for positive integers t and m (1 <= m < t - 1). This completely answers the question 3 in paper Faudree et al. (2013), partially answers the question 4 in paper Faudree et al. (2013) and the question 1 in Faudree and Gould (2014).

• 出版日期2016-5-11
• 单位郑州大学