Edge Cut Domination, Irredundance, and Independence in Graphs

Todd Fenstermacher, Stephen Hedetniemi, Renu Laskar

An edge dominating set $F$ of a graph $G=(V,E)$ is an \textit{edge cut dominating set} if the subgraph $⟨V,G-F⟩$ is disconnected. The \textit{edge cut domination numb…