首页 | 本学科首页   官方微博 | 高级检索  
     检索      

图的符号k-控制
引用本文:袁秀华.图的符号k-控制[J].华东交通大学学报,2008,25(4):100-102.
作者姓名:袁秀华
作者单位:南京林业大学,数学系,江苏,南京,210037
摘    要:设G(V,E)为一个图,k为任意的正整数且k不超过|G|,若有一个函数f:V|1,-1|满足:V中至少有k个点满足fv]≥1,则称f为图G的一个符号k-控制函数,图G的符号k-控制数定义为γks^-11(G)=min{f(V)|f为图G的一个符号k-控制}.给出了图的符号k-控制数的下界的一个改进的结论,并确定了轮图的符号k-控制数、

关 键 词:符号k-控制函数  符号k-控制数  轮图

On Signed k-subdomination Numbers of Graphs
YUAN Xiu-hua.On Signed k-subdomination Numbers of Graphs[J].Journal of East China Jiaotong University,2008,25(4):100-102.
Authors:YUAN Xiu-hua
Institution:YUAN Xiu-hua(Mathematics Department,Nanjing Forestry University,Nanjing 210037,China)
Abstract:Suppose G( V, E) is a graph, k is a random positive integer less than I GI. If a function f: V{ 1 ,-1} satisfy: there are at least k vertices satisfied with f v] 1, then f is a signed k-subdomination function of G. We denote the signed k-subdomination numbers by γks^-11(G) ,which is the minimum signed k-subdomination function of G. In this paper, we give a improved low bound of the signed k-subdomination number of a graph G, finally the signed k-subdomination num- bers of wheels are determined.
Keywords:signed k-subdomination function  signed k-subdomination numbers  wheels  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《华东交通大学学报》浏览原始摘要信息
点击此处可从《华东交通大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号