T. Fenstermacher

activity

20162019

collaborators

4 papers

math.CO2019

Properties of Partial Dominating Sets of Graphs

Benjamin M. Case, Todd Fenstermacher, Soumendra Ganguly +1

A set $S \subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$ . The domination number $γ (G)$ of $G$ equals the minimum cardina…

math.CO2018

Perfect Domination in Knights Graphs

Todd Fenstermacher, Soumendra Ganguly, Renu Laskar

For a graph $G = (V, E),$ a subset $S$ of $V$ is a perfect dominating set of $G$ if every vertex not in $S$ is adjacent to exactly one vertex in $S .$ The perfect domination number,…

math.CO2018

$P$ -Matchings in Graphs: A Brief Survey with Some Open Problems

Todd Fenstermacher, Soumendra Ganguly, Stephen Hedetniemi +1

For a graph $G = (V, E),$ a matching $M$ 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…

math.CO2016

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…

Properties of Partial Dominating Sets of Graphs

Perfect Domination in Knights Graphs

P-Matchings in Graphs: A Brief Survey with Some Open Problems

Edge Cut Domination, Irredundance, and Independence in Graphs

$P$ -Matchings in Graphs: A Brief Survey with Some Open Problems