Weak saturation numbers of and
A graph is weakly -saturated if contains no copy of , and there is an ordering of all edges bempresas.com of so that if they are added one at a time, they form a complete graph and each edge added creates a new copy of.The minimum size of a weakly -saturated graph of order is weak saturation number, denoted by.Let denote the complete graph with ver