关于图的强符号全控制数  

On the strong signed total domination number of a graph

作　　者：卢君龙[1,2] 吕新忠[1] 

机构地区：[1]浙江师范大学数理与信息工程学院,浙江金华321004 [2]浙江省回浦中学,浙江台州317000

出　　处：《纯粹数学与应用数学》2013年第1期75-81,共7页Pure and Applied Mathematics

基　　金：国家自然科学基金(61170302)

摘　　要：图的强符号全控制数有着许多重要的应用背景,因而确定其下界有重要的意义.本文提出了图的强符号全控制数的概念,在构造适当点集的基础上对其进行了研究,给出了:(1)一般图的强符号全控制数的5个独立可达的下界及达到其界值的图;(2)确定了圈、轮图、完全图、完全二部图的强符号全控制数的值.The strong signed total domination number of a graph has its important applying background, so it is useful to investigate the bounds of it. In this paper we point out the concept of the strong signed total domination number of a graph and research based on construction of suitable vetex sets. We obtain： （1） the five sharp lower bounds of the strong signed total domination number of a general graph and some graphs which attain these lower bounds respectively. （2） the exact values of the strong signed total domination number of a cycle graph, a wheel graph, a complete graph, a complete bipartite graph and so on.

关 键 词：图 强符号全控制数 强符号全控制函数 下界 

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