A Note on Edge Coalitions in Graphs

Haynes et al. (2020) introduced and investigated the concept of coalition in graphs \cite{hhhmm1}. Their study examined this concept from a vertex-based perspective, whereas in this paper, we extend the investigation to an edge-based perspective of graphs. \ An edge coalition in a graph $G=(V,E)$ consists of two disjoint sets of edges $E_1$ and $E_2$, neither of which individually forms an edge dominating set, but whose union $E_1\cup E_2$ is an edge dominating set. An edge coalition partition in a graph $G$ of order $n=\mathrm{\mid }V\mathrm{\mid }$ and size $\mathrm{\mid }E\mathrm{\mid }=m$ is an edge partition $\pi =\{E_1,\cdots ,E_k\}$ so that every set $E_i$ of $\pi$ either is a singleton edge dominating set, or is not an edge dominating set but forms an edge coalition with another set $E_j$ in $\pi$, which is also not an edge dominating set. In this paper, we introduce the concept of an edge coalition and demonstrate its existence in particular graphs and trees. Additionally, we characterize graphs with small number of edge coalitions and analyze edge coalition structures in various special graph classes.