New bounds on the signed domination numbers of graphs
2014
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:
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
2
References
0
Citations
NaN
KQI