| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651094 | Discrete Mathematics | 2007 | 6 Pages |
Abstract
It is shown that the lower irredundance number and secure domination number of an n vertex tree T with maximum degree Δ⩾3Δ⩾3, are bounded below by 2(n+1)/(2Δ+3)2(n+1)/(2Δ+3)(T≠K1,Δ)(T≠K1,Δ) and (Δn+Δ-1)/(3Δ-1)(Δn+Δ-1)/(3Δ-1), respectively. The bounds are sharp and extremal trees are exhibited.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
E.J. Cockayne,