| Summary: | A graph G is weakly F-saturated if G contains no copy of F, and there is an ordering of all edges of G¯so that if they are added one at a time, they form a complete graph and each edge added creates a new copy of F. The minimum size of a weakly F-saturated graph G of order n is weak saturation number, denoted by wsat(n,F). Let Ktdenote the complete graph with t vertices, Kp,qdenote the complete bipartite graph with partite sizes of p and q, and Kp⋃Kqdenote the complement of Kp,q. In this paper, we determine wsat(n,Kp⋃Kq)and wsat(n,K2,t)whose significance can be seen in the introduction. Keywords: Weakly saturated graph, Weak saturation number, Complete graph, Complete bipartite graph
|
|---|
