Title of article
Acyclic domination Original Research Article
Author/Authors
S.M. Hedetniemi، نويسنده , , S.T. Hedetniemi، نويسنده , , D.F. Rall، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
15
From page
151
To page
165
Abstract
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.
Keywords
Dominating set , Irredundance , Acyclic
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950528
Link To Document