T. Fenstermacher

activity

20162019

collaborators

Showing 2018Show all

2 papers · 1 filter

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…

Perfect Domination in Knights Graphs

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

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