| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9512137 | Discrete Mathematics | 2005 | 23 Pages |
Abstract
In this paper, combinatorial enumeration techniques are used to derive the exact formulas for the number of efficient dominating sets among all labeled rooted oriented trees. These formulas are used to find the number of efficient dominating sets among all labeled rooted oriented trees of order p for each p up to 45. Finally, the asymptotic formulas for the number of efficient dominating sets among all labeled rooted oriented trees are also determined.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Allen J. Schwenk, Bill Q. Yue,