New bounds on the signed domination numbers of graphs
Combinatorics
2019-08-27 v1
Abstract
In this paper, we study the signed domination numbers of graphs and present new sharp lower and upper bounds for this parameter. As an example, we present a lower bound on signed domination number of trees in terms of the order, leaves and support vertices.
Keywords
Cite
@article{arxiv.1409.2755,
title = {New bounds on the signed domination numbers of graphs},
author = {S. M. Hosseini Moghaddam and Abdollah Khodkar and Babak Samadi},
journal= {arXiv preprint arXiv:1409.2755},
year = {2019}
}