Name
Abstract | ||
|---|---|---|
We give recursive methods for enumerating the number of orientations of a tree which can be efficiently dominated. We also examine the maximum number eta(q) of orientations admitting an efficient dominating set in a tree with q edges. While we are unable to give either explicit formulas or recursive methods for finding eta(q), we are able to show that the growth rate of the sequence (eta(q)) Stabilizes by showing that lim(q-->infinity) eta(q)(1/q) exists. |
Year | Venue | Keywords |
|---|---|---|
1997 | ARS COMBINATORIA | dominating set |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Dominating set,Connected dominating set,Mathematics | Journal | 45 |
ISSN | Citations | PageRank |
0381-7032 | 1 | 0.48 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David W. Bange | 1 | 6 | 2.49 |
| Anthony E. Barkauskas | 2 | 6 | 2.49 |
| Lane H. Clark | 3 | 43 | 9.39 |