1 citations · 1 across the 4 of their papers we have counts for
4 papers
Properties of Partial Dominating Sets of Graphs
Benjamin M. Case, Todd Fenstermacher, Soumendra Ganguly +1
A set is a dominating set of if every vertex in is adjacent to at least one vertex in . The domination number of equals the minimum cardina…
Perfect Domination in Knights Graphs
Todd Fenstermacher, Soumendra Ganguly, Renu Laskar
For a graph a subset of is a perfect dominating set of if every vertex not in is adjacent to exactly one vertex in The perfect domination number,…
-Matchings in Graphs: A Brief Survey with Some Open Problems
Todd Fenstermacher, Soumendra Ganguly, Stephen Hedetniemi +1
For a graph a matching is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed…
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…