Irredundance, secure domination and maximum degree in trees Original Research Article

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.