期刊文献+

邻域并与[a,b]-k-对等图 被引量:4

Neighborhood Union for [a,b]-k-uniform Graphs
下载PDF
导出
摘要 设G是一个n阶图,1≤a<b及b≥k≥0是整数,本文证明了若n≥2(a+b)(a+bb-1)+2k,图G的最小度δ(G)≥a+k,且NG(x)∪NG(y)≥ana++2bk,则G是[a,b]-k-对等图,推广了已有的结果。 Let G be a graph of order n, and let k, a and b be integers such that 1 ≤a 〈b,0≤k≤b and n≥ 2(a+b)(a+b-1)+2k/b.Then it is proved that G is an [ a, b ]-k-uniform graph if the minimum degree δ(G)a+k,and |NG(x)∪NG(y)|≥an+2k/a+b .This result is an extension of some results.
作者 周思中
出处 《江苏科技大学学报(自然科学版)》 CAS 北大核心 2006年第6期34-36,共3页 Journal of Jiangsu University of Science and Technology:Natural Science Edition
关键词 因子 对等图 邻域并 graph factor uniform graph neighborhood union
  • 相关文献

参考文献7

  • 1[1]BONDY J A,MURTY U S R.Graph Theory with Applications[M].London:The Macmillan Press,1976.
  • 2[2]LI Y.CAI M.A degree condition for a graph to have[a,b]-factors[J].J Graph Theory,1998,27:1-6.
  • 3[3]MATSUDA H.A neighborhood condition for graphs to have[a,b]-factors[J].Discrete Mathematics,2000,224:289 -292.
  • 4[4]KATERINIS P.Toughness of graphs and existence of factors[J].Discrete Math,1990,80:81-92.
  • 5[5]LOVASZ L.Subgraph with prescribed valencies[J].J Combin.Theory,1970,8:391-416.
  • 6李国君,刘桂真.与任意图正交的(g,f)-因子分解[J].中国科学(A辑),1997,27(12):1083-1088. 被引量:33
  • 7[7]YUAN J,YU J.Random (m,r)-orthogonal (g,f)-factorizable graphs[J].Applied Mathematics Journal of Chinese Universities,1998,13A(3):311-318.

二级参考文献2

共引文献32

同被引文献39

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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