期刊文献+

几类图的强符号控制数 被引量:2

Strong Signed Domination in General Graph
下载PDF
导出
摘要 本文对几类特殊图的强符号控制函数及强符号控制数进行了研究,给出了完全图、完全二部图、路及圈的强符号控制数。 The properties about strong signed domination function and strong signed domination number of graph have been studied. In this paper, we do some study on the properties of complete graph, complete 2- partite graph, path, cycle and so
出处 《长春师范学院学报(自然科学版)》 2007年第1期11-13,共3页 Journal of Changchun Teachers College
关键词 强符号控制函数 强符号控制数 graph strong signed domination function strong signed domination, number
  • 相关文献

参考文献4

  • 1[1]Ore O.Theory of Graphs[M].Amer.Math.Soc.Colloq.Pybl.38,American Mathe-matical Society,Providence,1962.
  • 2[2]Dunbar Jean,Hedetniemi Stephen,Henning Michael A,McRae Alice.Minus domination in graphs[J].Discrete Mathematics,1999,199:35-47.
  • 3[3]DunbarJ,et al.Signed domination in graphs[J].Graphy Theory,Combinatorics and Applications,1995,(1):311-322.
  • 4王朝瑞.图论[M].北京:高等教育出版社,1981..

共引文献16

同被引文献5

  • 1李瑞娟,符月芳.关于图的强符号控制数的下界[J].廊坊师范学院学报,2007,23(3):14-15. 被引量:1
  • 2Cockayne E J, Mynhardt C M. On a generalization of signed dominating function of graphs [ J ]. Ars Combin. 1996, 43:235-245.
  • 3Chen WD, Song EM. Lower bounds on several versions of signed domination number [ J ]. Discrete Math. , 2008, 308:1837 - 1846.
  • 4Bondy J A, Murty U S R. Graph Theory with Applications [M]. Macmillan, New York, 1976.
  • 5Kang LY, Qiao H, Shan EF, et al. Lower bounds on the minus domination and k-subdomination numbers [ J ]. Theoretical Computer Science, 2003, 296 : 89 - 98.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部