Showing 2016Show all
2 papers · 1 filter
math.CO2016
Split Domination, Independence, and Irredundance in Graphs
Stephen Hedetniemi, Fiona Knoll, Renu Laskar
In 1978, Kulli and Janakiram \citep{KulliJanakiramSplit} defined the split dominating set: a dominating set of vertices in a graph is called {\em split dominating}…
math.CO2016
Edge Cut Domination, Irredundance, and Independence in Graphs
Todd Fenstermacher, Stephen Hedetniemi, Renu Laskar
An edge dominating set of a graph is an \textit{edge cut dominating set} if the subgraph is disconnected. The \textit{edge cut domination numb…