图的并的严格强控制数的若干新结论

Some New Conclusions On Strict Majority Domination Number of Unions of Graphs

图的严格强控制数是图的符号控制数的推广,该文在图的符号控制数的基础上,研究了图的严格强控制数,并且得到了Kn-e的严格强控制数,通过对图的并的严格强控制数的研究,进一步得到了一些图的并的严格强控制数与图的阶数的关系。

In this paper, the signal majority domination number of graphs is generalized to strict majority domination number of graphs. We investigate the strict majority domination number of based on the signal majority domination number of graphs. Accord- ing to study for strict majority domination number of some unions of graphs, we determine the strict majority domination number of some unions of graphs and discuss relation the strict majority domination number of some unions of graphs and order number of graphs.