Benjamin M. Case

collaborators

3 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.CO2019

$β$ -Packing Sets in Graphs

Benjamin M. Case, Evan M. Haithcock, Renu C. Laskar

A set $S \subseteq V$ is $α$ -dominating if for all $v \in V - S$ , $∣ N (v) \cap S ∣ \geq α ∣ N (v) ∣.$ The $α$ -domination number of $G$ equals the minimum cardinality of an $α$ -dominating se…

math.CO2017

Partial Domination in Graphs

Benjamin M. Case, Stephen T. Hedetniemi, Renu C. Laskar +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…

Properties of Partial Dominating Sets of Graphs

β-Packing Sets in Graphs

Partial Domination in Graphs

$β$ -Packing Sets in Graphs