Saturation numbers of some joins of graphs

Abstract

Let $H$ be a graph. A graph $G$ is $H$-saturated if $G$ is $H$-free, but adding any edge between two non-adjacent vertices of $G$ yields an $H$-copy as a subgraph. The saturation number $\mathrm{sat}(n,H)$ is the minimum number of edges in an $H$-saturated graph on $n$ vertices. The saturation number for the join of a vertex and a graph $F$, denoted by $K_1\vee F$, has attracted considerable attention. Cameron and Puleo [Discrete Math. 345 (2022), 112867] proved that $\mathrm{sat}(n,K_1\vee F)\le n-1+\mathrm{sat}(n-1,F)$ for $n>|V(F)|$. A natural question is when the above equality holds. Most existing results impose conditions on $F$ and assume that $F$ has no isolated vertices. Let $K_p^{-}$ be the graph obtained by deleting one edge from the complete graph $K_p$. In this paper, we investigate the saturation number of $K_1\vee F$ when $F$ contains isolated vertices, and determine the exact value of $\mathrm{sat}(n,K_1\vee F)$ when $F=K_3^{-}\cup s{K}_1(s\ge 1)$ or $F=K_{p-1}^{-}\cup K_1(p\ge 5)$. In our results, $\mathrm{sat}(n,K_1\vee F)=n-1+\mathrm{sat}(n-1,F)$ holds when $F=K_3^{-}\cup s{K}_1$ for any $s\ge 1$, but fails when $F=K_{p-1}^{-}\cup K_1$ for $p\ge 5$.