On k-coalition partitions of graphs

Abstract

In a graph, a set $D$ is $k$-dominating if every vertex in $V(G) \setminus D$ has at least $k$ neighbors in $D$. Jafari, Alikhani, and Bakhshesh introduced the concept of a $k$-coalition, which is a pair of disjoint sets $X_1$ and $X_2$ of vertices such that neither is a $k$-dominating set but $X_1 \cup X_2$ is a $k$-dominating set. A $k$-coalition partition is a vertex partition in which each set either forms a $k$-coalition with some other set or is itself a $k$-dominating set with exactly $k$ vertices. The $k$-coalition number $\operatorname{CO_k}(G)$ is the maximum number of sets in a $k$-coalition partition. We compute the $k$-coalition number for several families and bound the $k$-coalition number under disjoint union and graph join. We show that the set of possible sizes of $k$-coalition partitions forms an interval. Finally, we investigate $k$-coalition graphs and prove that every graph is a $k$-coalition graph.