On the saturation number of the kite graph

Huanying Bian, Qing Cui, Shengjin Ji +1

For a fixed graph $H$, a graph $G$ is $H$-saturated if $G$ does not contain a copy of $H$, but adding any edge $e\in E(\overline{G})$ to $G$ creates a copy of $H$. The saturation…