IJPAM: Volume 41, No. 6 (2007)
ON THE NUMBER OF DOMINATING SETS
IN SOME CLASSES OF TREES
IN SOME CLASSES OF TREES
Dorota Bród
Faculty of Mathematics and Applied Physics
Technical University of Rzeszów
2, ul. W. Pola, Rzeszów, 35-959, POLAND
e-mail: dorotab@prz.edu.pl
Faculty of Mathematics and Applied Physics
Technical University of Rzeszów
2, ul. W. Pola, Rzeszów, 35-959, POLAND
e-mail: dorotab@prz.edu.pl
Abstract.A dominating set of a graph 
is a vertex subset 
such that every vertex of either is in or is adjacent to a vertex in . The number of dominating sets in special kinds of trees is determined. Some of these results are given by recurrence relations.
Received: July 4, 2007
AMS Subject Classification: 05C20
Key Words and Phrases: dominating sets, trees, counting
Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2007
Volume: 41
Issue: 6
