D. J. Lipman

collaborators

Showing math.COShow all

2 papers · 1 filter

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…

math.CO2015

Cycle Domination, Independence and Irredundance in graphs

Amy Grady, Fiona Knoll, Renu Laskar +1

A set $S$ of vertices in a graph $G = (V, E)$ is called {\em cycle independent} if the induced subgraph $⟨ S ⟩$ is acyclic, and called {\em odd-cycle indepdendet} if $\l…