期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

蕴含kC_6的可图序列 被引量：1

On Potentially kC_6-graphic Sequences
在线阅读 下载PDF
导出
摘要 刻画了蕴含3C64、C6以及5C6的可图序列,其中一个图G称为具有性质kCl,如果G含有长依次为k,k+1,…,l的圈. The criterions for a graphic sequence being potentially 3C6-graphic, 4C6-graphic and 5C6-graphic are obtained, of which a grapha G is said to potentially κCl if G contains a cycle of length r for each r, k≤r≤l.
作者 陈纲 尹建华 范英梅
机构地区 宁夏大学数学计算机学院 海南大学信息科学技术学院 广西大学数学与信息科学学院
出处 《广西师范大学学报（自然科学版）》 CAS 北大核心 2006年第3期26-29,共4页 Journal of Guangxi Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(10401010) 宁夏大学青年研究基金资助项目(QN0505)
关键词 图 度序列 蕴含kC6的可图序列 graph degree sequence potentially κC6-graphic sequence
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献10

  • 1GOULD R J,JACOBSON M S,LEHEL J.Potentially G-graphic degree sequences[C]//ALAVI Y.Combinatorics,Graph Theory,and Algorithms.Kalamazoo Michigan:New Issues Press,1999:451-460.
  • 2ERDOS P,JACOBSON M S,LEHEL J.Graphs realizing the degree sequences and their respective clique numbers[C]//ALAVI Y.Graph Theory,Combinatorics and Applications.New York:John Wiley & Sons,1991:439-449.
  • 3LI Jiong-sheng,SONG Zi-xia.An extremal problem on the potentially Pk-graphic sequence[J].Discrete Math,2000,212(3):223-231.
  • 4LI Jiong-sheng,SONG Zi-xia.The smallest degree sum that yields potentially Pk-graphic sequences[J].J Graph Theory,1998,29:63-72.
  • 5李炯生,宋梓霞,罗荣.The Erds-Jacobson-Lehel conjecture on potentially P_k-graphic sequence is true[J].Science China Mathematics,1998,41(5):510-520. 被引量：13
  • 6赖春晖.蕴含C_K图的度序列[J].漳州师院学报,1997,11(4):27-31. 被引量：7
  • 7LAI Chun-hui.The smallest degree sum that yields potentially Ck-graphic sequences[J].Journal of Combinatorial Mathematics and Combinatorial Computing,2004,49:57-64.
  • 8LUO Rong.On potentially Ck-graphic sequences[J].Ars Combinatoria,2002,64:301-318.
  • 9KLEITMAN D J,WANG Da-lun.Algorithm for constructing graphs and digraphs with given valences and factors[J].Discrete Math,1973,6 (1):79-88.
  • 10LI Jiong-sheng,YIN Jian-hua.A variation of an extremal theorem due to Woodall[J].Southeast Asian Bulletin ofMathematics,2001,25:427-434.

二级参考文献1

共引文献14

同被引文献6

  • 1ESCHEN E M ,NIU J B. On potentially K4--e-graphic sequences[J]. Australasian J Combinatorics ,2004,29..59-65.
  • 2YIN Meng-xiao,YIN Jian-hua. On potentially H-graphic sequences[J]. Czechoslovak Mathematical Journal, 2007,57 (2):705-724.
  • 3KLEITMAN D J,WANG Da-lun. Algorithm for constructing graphs and digraphs with given valences and factors [J]. Discrete Math, 1973,6 (1) : 79-88.
  • 4ERDOS P,GALLAI T. Graphs with given degrees of vertices[J]. Math Lapok,1960,11:264-274.
  • 5YIN Jian-hua,LI Jiong-sheng. An extremal problem on potentially Kr,s-graphic sequences is true[J]. Discrete Math, 2003,260: 295-305.
  • 6GOULD R J,JACOBSON M S,LEHEL J. Potentially G-graphical degree sequences[C]//ALAVI Y. Combinatorics, Graph Theory,and Algorithms. Kalamazoo Michigan :New Issues Press, 1999 : 451-460.

引证文献1

二级引证文献2

广西师范大学学报（自然科学版）
2006年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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