删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

一个实现包含圈C3,...,Cl可图序列问题的渐近解

本站小编 Free考研考试/2021-12-27

一个实现包含圈C3,...,Cl可图序列问题的渐近解 李光明, 尹建华海南大学理学院 海口 570228 Asymptotic Solution to a Problem about Graphic Sequences with a Realization Containing Cycles C3,..., Cl Guang Ming LI, Jian Hua YINSchool of Science, Hainan University, Haikou 570228, P. R. China
摘要
图/表
参考文献
相关文章

全文: PDF(564 KB) HTML (1 KB)
输出: BibTeX | EndNote (RIS)
摘要一个非增的非负整数序列π=(d1,...,dn)称为是可图的如果它是一个n个顶点的简单图G的度序列.一个可图序列π=(d1,...,dn)称为是蕴含3Cl-可图的如果π有一个实现包含每一个长为r的圈,其中3 ≤ rl.众所周知,如果一个关于l个顶点的图G的非增的度序列(d1,...,dl)满足Pósa条件,即如果对于每一个i,1 ≤ i < l/2,有di+1-ii+1,则G是泛圈的或者是二部的.在本文中,我们得到了一个蕴含3Cl-可图序列的Pósa-型条件,即证明如果l ≥ 5是一个整数,nlπ=(d1,...,dn)是一个可图序列满足对于每一个i,1 ≤ i < l/2,有di+1-ii+1,则π是蕴含3Cl-可图的.我们也证明了这个结果是Li等人[Adv.Math.(China),2004,33(3):273-283]一个问题的渐近解.作为应用,我们也证明了此结果完全包含了Lai[J.Combin.Math.Combin.Comput.,2004,49:57-64]对于l ≥ 5且nlσCln)之值.
服务
加入引用管理器
E-mail Alert
RSS
收稿日期: 2020-03-27
MR (2010):O157.5
基金资助:海南省自然科学基金高层次人才资助项目(2019RC085);国家自然科学基金资助项目(11961019)
通讯作者:尹建华,E-mail:yinjh@hainanu.edu.cn
作者简介: 李光明,E-mail:m15964910127@163.com
引用本文:
李光明, 尹建华. 一个实现包含圈C3,...,Cl可图序列问题的渐近解[J]. 数学学报, 2021, 64(3): 443-454. Guang Ming LI, Jian Hua YIN. Asymptotic Solution to a Problem about Graphic Sequences with a Realization Containing Cycles C3,..., Cl. Acta Mathematica Sinica, Chinese Series, 2021, 64(3): 443-454.
链接本文:
http://www.actamath.com/Jwk_sxxb_cn/CN/ http://www.actamath.com/Jwk_sxxb_cn/CN/Y2021/V64/I3/443


[1] Bondy J. A., Murty U. S. R., Graph Theory with Applications, North-Holland, New York, 1976.
[2] Chen G., Fan Y. M., Yin J. H., On potentially 3C6-graphic sequences, J. Guangxi Normal Univ. (Nat. Sci. Ed.), 2006, 24(3):26-29.
[3] Erd?s P., Gallai T., Graphs with prescribed degrees of vertices (Hungarian), Mat. Lapok, 1960, 11:264-274.
[4] Gould R. J., Jacobson M. S., Lehel J., Potentially G-graphical degree sequences, in:Y. Alavi et al., (Eds.), Combinatorics, Graph Theory, and Algorithms, New Issues Press, Kalamazoo Michigan, 1999:451-460.
[5] Kleitman D. J., Wang D. L., Algorithm for constructing graphs and digraphs with given valences and factors, Discrete Math., 1973, 6:79-88.
[6] Lai C. H., The smallest degree sum that yields potentially Ck-graphical sequences, J. Combin. Math. Combin. Comput., 2004, 49:57-64.
[7] Li J. S., Yin J. H., Extremal graph theory and degree sequences (Chinese), Adv. Math. (China), 2004, 33(3):273-283.
[8] Nash-Williams C. St. J. A., Valency sequences which force graphs to have hamiltonian circuits, Interim report, University of Waterloo, Waterloo, 1970.
[9] Schmeichel E. F., Hakimi S. L., Pancyclic graphs and a conjecture of Bondy and Chvátal, J. Combin. Theory (B), 1974, 17:22-34.
[10] Yin J. H., A characterization for a graphic sequence to be potentially Cr-graphic, Sci. China Math., 2010, 53(11):2893-2905.
[11] Yin J. H., Chen G., Chen G. L., On potentially kCl-graphic sequences, J. Combin. Math. Combin. Comput., 2007, 61:141-148.
[12] Yin J. H., Ye K., Li J. Y., Graphic sequences with a realization containing cycles C3,..., Cl, Appl. Math. Comput., 2019, 353:88-94.

[1]尹建华. r-可图序列与r-完全子图[J]. Acta Mathematica Sinica, English Series, 2013, 56(3): 369-380.
[2]潘建中. K理论在实现问题中的应用[J]. Acta Mathematica Sinica, English Series, 1991, 34(3): 352-359.
[3]谢朗. 单连通5维多面体的伦型问题[J]. Acta Mathematica Sinica, English Series, 1987, 30(4): 467-477.
[4]赖允柱. 一个同调函子[J]. Acta Mathematica Sinica, English Series, 1983, 26(5): 566-572.
[5]吴文俊. 复合形在欧氏空间中的实现问题Ⅲ[J]. Acta Mathematica Sinica, English Series, 1958, 8(1): 79-94.
[6]吴文俊. 复合形在欧氏空间中的实现问题(Ⅱ)[J]. Acta Mathematica Sinica, English Series, 1957, 7(1): 79-101.



PDF全文下载地址:

http://www.actamath.com/Jwk_sxxb_cn/CN/article/downloadArticleFile.do?attachType=PDF&id=23761
相关话题/序列 空间 海南大学 数学 理学院