A note on the annihilation number and 2-domination number of a tree

Document Type

Article

Peer Reviewed

1

Publication Date

5-2-2016

Scholarship Domain(s)

Scholarship of Discovery

Abstract

In 2014, Desormeaux et al. (Discrete Math 319:15–23, 2014) proved a relationship between the annihilation number and 2-domination number of a tree. In this note, we provide a family of bounds for the 2-domination number of a tree based on the amount of vertices of small degree. This family of bounds extends current bounds on the 2-domination number of a tree, and provides an alternative proof for the relationship between the annihilation number and the 2-domination number of a tree that was shown by Desormeaux et al.

Comments

Published in the Journal of Combinatorial Optimization and available to Benner Library patrons through Interlibrary Loan.

Link to Full Text

Share

COinS