Secure domination in $P_5$-free graphs

Uttam K. Gupta, Michael A. Henning, Paras Vinubhai Maniya +1

A dominating set of a graph $G$ is a set $S\subseteq V(G)$ such that every vertex in $V(G)\setminus S$ has a neighbor in $S$, where two vertices are neighbors if they are adjacen…