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…