关于图的并的严格强控制数  

On the Strict Majority Domination Number of Unions of Some Graphs

作　　者：任庆军[1] 傅英定[2] 

机构地区：[1]山东临沂师范学院数学系,山东临沂276005 [2]电子科技大学应用数学学院,成都610054

出　　处：《电子科技大学学报》2004年第4期478-480,共3页Journal of University of Electronic Science and Technology of China

基　　金：山东省教育科技计划项目(J01P51)

摘　　要：图的严格强控制数是图的符号控制数的推广,该文在图的符号控制数的基础上,研究了图的严格强控制数,并且决定了一些图的并的严格强控制数。通过对图的并的严格强控制数的研究,进一步得到了一些图的并的严格强控制数与图的阶数的关系。In this paper, the signal majority domination number of graphs is generalized to strict majority domination number of graphs. We investigated the strict majority domination number of some unions of graphs based on the signal majority domination number of graphs. According to study for strict majority domination number of some unions of graphs, we determined 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.

关 键 词：严格强控制数 图 函数 奇偶性 

分 类 号：O157.5[理学—数学]