加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本