Title of article
Irredundance, secure domination and maximum degree in trees Original Research Article
Author/Authors
E.J. Cockayne، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
6
From page
12
To page
17
Abstract
It is shown that the lower irredundance number and secure domination number of an n vertex tree T with maximum degree image, are bounded below by image image and image, respectively. The bounds are sharp and extremal trees are exhibited.
Keywords
Tree , Maximum degree , Secure domination , Irredundance
Journal title
Discrete Mathematics
Serial Year
2007
Journal title
Discrete Mathematics
Record number
947485
Link To Document