Acyclic domination Original Research Article

A subset A of the vertex set V(G) of a graph G is called acyclic if the subgraph it induces in G contains no cycles. A is called an acyclic dominating set of G if it is both acyclic and dominating. We begin an investigation of acyclic domination and the related acyclic irredundance numbers.