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

5个素数阶完全图的循环图分解
引用本文:张忠辅,苏文龙.5个素数阶完全图的循环图分解[J].西北民族学院学报,1999,20(2):8-12.
作者姓名:张忠辅  苏文龙
作者单位:[1]兰州铁道学院应用数学所 [2]广西计算中心
基金项目:国家自然科学基金,广西自然科学基金
摘    要:研究了素数阶完全图分解成若干个循环图的方法,给出了这个完全图子图团数的算法获得了2个三色和3个四色Ramsey数的新下界:R(3,4,8)138,R(3,6,14)570,R(3,3,5,8)402,R(3,3,6,13)1010,R(3,4,5,14)1218

关 键 词:Ramsey数  下界  循环图  算法

Five Decompositions of a Complete Graph into Prime Order Circulant Graphs
ZHANG Zhong-fu ,SU Wen-long ,LUO Hai-peng.Five Decompositions of a Complete Graph into Prime Order Circulant Graphs[J].Journal of Northwest Minorities University(Natural Science ),1999,20(2):8-12.
Authors:ZHANG Zhong-fu  SU Wen-long  LUO Hai-peng
Institution:ZHANG Zhong-fu 1,SU Wen-long 2,LUO Hai-peng 3
Abstract:The method that prime order complete graphs are resolved into some circulant graphs is studied.An algorithm for computing clique numbers of subgraphs of the complete graph is developed.New lower bounds of two 3-color and three 4-color Ramsey numbers were obtained:R(3,4,8)138,R(3,6,14)570,R(3,3,5,8)402,R(3,3,6,13)1010,R(3,4,5,14)1218.
Keywords:Ramsey number  lower bound  circulant graph  algorithm
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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