Efficient and Perfect domination on circular-arc graphs

Min Chih Lin, Michel J. Mizrahi, Jayme L. Szwarcfiter

Given a graph $G=(V,E)$, a \emph{perfect dominating set} is a subset of vertices $V^{\prime }\subseteq V(G)$ such that each vertex $v\in V(G)\setminus V^{\prime }$ is dominated by exactly one ve…