期刊文献+

一类偶图的符号边控制数 被引量:4

Signed Edge Domination Numbers for a Class Of Bipartite Graphs
在线阅读 下载PDF
导出
摘要 对于任意正整数m和n,构造了一类偶图(二部图)G(m,n),其阶为2mn,边数为3mn-m-n,确定了其符号边控制数为γ′s(G(m,n))=m+n-mn.从而证明了n阶偶图的最小符号边控制数B(n)<1+22n-n2,并指出了文[6]一个猜想的错误. For any positive integers m and n, a class of bipartite graphs G=G(m,n) with |E(G)|=3mn-m-n、|V(G)|=2mn and γ′_s(G(m,n))=m+n-mn are designed. And further, The supper bounds of the minimum signed edge domination numbers B(n)for bipartite graphs of order n are given. That is, B(n) <1+22n-n2, and disprove a conjecture in[6].
作者 徐保根
出处 《华东交通大学学报》 2004年第2期124-126,共3页 Journal of East China Jiaotong University
基金 江西省自然科学基金课题(0311047)
关键词 偶图 符号边控制数 符号控制函数 图论 bipartite graph signed edge domination number signed edge domination function
  • 相关文献

参考文献8

  • 1Bondy. J. A. and Muny U. S. R., Graph Theory with Application[M]. Macmillan, London, 1977.
  • 2Baogen. Xu, On signed edge domination numbers of graphs,Discrete Math. 2001, (239): 179 - 189.
  • 3Z. Zhang, Baogen. Xu, Y. Li, L. Liu, A note on the lower bounds of signed domination number of a graph, Discrete Math. 1999,(195):295~298.
  • 4徐保根.On Minus Domination and Signed Domination in Graphs[J].Journal of Mathematical Research and Exposition,2003,23(4):586-590. 被引量:21
  • 5徐保根.关于图的符号边控制数的下界[J].华东交通大学学报,2004,21(1):110-113. 被引量:4
  • 6徐保根,曾毅.关于图的符号边控制数的上界[J].华东交通大学学报,2002,19(1):55-57. 被引量:3
  • 7Baogen. Xu, E.J.Cockayne, T.W.Haynes, S.T. Hedetniemi,S.Zhou, Extremal graphs for inequalities involving domination parameters, Discrete Math. 2000, (216): 1 ~ 10.
  • 8Baogen Xu. Shangchao Zhou, Characterization of connected graphs with maximum domination number[J].数学研究与评论,2000,(4):523~528.

二级参考文献23

  • 1[1]Bondy.J.A.and Murty U.S.R., Graph Theory with Applica tion[M].Macmillan,London,1977.
  • 2[2]Baogen Xu, On signed edge domination numbers of graphs[J].Discrete Math.239(2001) 179 ~ 189
  • 3[3]Baogen Xu, E.J.Cockayne, T.W.Haynes,S.T.Hedelniemi, Shangchao Zhou, Extermal graphs for inequalities involving domination paramelers [J].Discrete Math.216 (2000) 1 ~ 10.
  • 4[4]Baogen Xu Baogen Xu.Shangchao Zhou, Characterization of connected graphs with maximum domination number [J].数学研究与评论.4( 2000) 523 ~ 528.
  • 5[5]Zhongfu Zhang, Baogen Xu, Yinzhen Li, Linzhong Liu, A note on the lower bounds of signed domination number of a graph[J].Discrete Math.195 (1999) 295 ~ 298.
  • 6[6]J.H.Hallingh, E.Ungerer, The signed and minus k- sub domination numbers of comets[J].DiscreteMath.183(1998) 141 ~ 152.
  • 7[7]E.J.Cockayne,C.M.Mynhardt, on a generaliza tion of signed dominating function of graphs, Ars.Combin.43(1996) 235~ 245.
  • 8[8]I.Broere J.H.Hattingh, M.A.Henning,A.A.Mcrae,Majority domination in graphs, Discrete Math.138(1995) 125~ 135.
  • 9[9]Baogen Xu, Ergen Liu, On the lower bounds of signed edge domination numbers of graphs, Discrete Math.Submitted.
  • 10DUNBAR J, HEDETNIEMI S, HENNING M A. et al. Minus dominationin graphs [J]. Discrete Math, 1999, 199: 35-47.

共引文献25

同被引文献20

  • 1李向军,袁旭东.C_3×C_n的符号边控制数[J].广西师范大学学报(自然科学版),2006,24(1):49-52. 被引量:4
  • 2徐保根.关于图的符号边全控制[J].华东交通大学学报,2006,23(2):129-131. 被引量:12
  • 3Bondy J A, Murty U S R.Graph theory with applications [ M ] . London:Macmillan,1977.
  • 4Baogen Xu. On signed edge domination numbers of graphs[J] .Discrete Math, 2001,239:179-189.
  • 5Z Zhang,Baogen Xu,Y Li,et al.A note on the lower bounds of signed domination number of a graph [J].Discrete Math, 1999, (195) :295-298.
  • 6Baogen xu.On edge domination numbers of graphs [J ] .Discrete Mathematics, 2005,294:311-316.
  • 7Bondy J A,Murty U S R. Graph theory with applications [ M ]. London: Macmillan,1977.
  • 8Z Zhang, Baogen Xu.A note on the lower bounds of signed domination number of a graph [J ].Discrete Math, 1999, (195): 295-298.
  • 9Baogen xu.Two classes of edge domination in graphs[J] .Discrete Applied Mathematics, 2006,154:1541-1546.
  • 10Baogen Xu.On signed edge domination numbers of graphs[J ] .Discrete Math, 2001,239:179-189.

引证文献4

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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