Connected Domination in Plane Triangulations

Felicity Bryant, Elena Pavelescu

A set of vertices of a graph $G$ such that each vertex of $G$ is either in the set or is adjacent to a vertex in the set is called a dominating set of $G$. If additionally, the set…