期刊文献+

赋权无三角形图中过给定顶点的重圈

Heavy cycles passing through given vertices in triangle-free weighted graphs
在线阅读 下载PDF
导出
摘要 这篇文章中,在Fujisawa的一篇文章的启发下,给出了以下结果:设G是一个2-连通无三角形(triangle-free)赋权图,d是一个非负实数.并且对G中任意顶点v,有d w(v)≥d.则对G中任意两个顶点y1和y2,G包含一个权至少为2d的(y1,y 2)-圈.这推广了Bondy和Fan,Grotschel,及Fujisawa的一些图中圈的存在性的结果. Motivated by a paper of Fujisawa, this paper gives the following result: Let G be a 2-connected triangle-free weighted graph and d be a nonnegative real number. If d^w(v) 〉 d for every vertex v in G, then for every two vertices y1 and y2 in G, G contains a (y1,y2) -cycle of weight at least 2d. This generalizes some results on cycles of Bondy and Fan, Grotschel and Fujisawa.
作者 陈冰
出处 《西南民族大学学报(自然科学版)》 CAS 2010年第4期507-509,共3页 Journal of Southwest Minzu University(Natural Science Edition)
基金 国家自然科学基金(10871158) 陕西省教育厅基金(09JK609)
关键词 赋权图 重圈 赋权度(和) 无三角形图 weighted graph heavy cycle weighted degree (sum) triangle-free graph
  • 相关文献

参考文献5

  • 1BONDY J A,FAN G.Optimal paths and cycles in weighted graphs[J].Ann Discrete Math,1989,41:53-69.
  • 2BONDY J A,MURTY U S R.Graph Theory with Applications[M].New York:North-Holland,1979.
  • 3FUJISAWA J,FUJITA S,YAMASHITA T.Heavy cycles in Hamiltonian weighted graphs[J].AKCE International Journal of Graphs and Combinatorics,2004,1:99-102.
  • 4FUJISAWA J.Heavy fans,cycles and paths in weighted graphs of large connectivity[J].Discrete Mathematics,2007,300:38-53.
  • 5GROTSCHEL M.Graphs with cycles containing given paths[J].Ann Discrete Math,1977,1:233-245.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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