限制度的IC平面图中轻弦4-圈的权和  

Weight of Light Chords 4-Cycles in IC-Planar Graphs with Degree Restrictions

作　　者：田京京[1] TIAN Jingjing(School of Mathematics and Computer Science,Shaanxi University of Technology,Hanzhong 723000,Shaanxi Province,China)

机构地区：[1]陕西理工大学数学与计算机科学学院,陕西汉中723000

出　　处：《吉林大学学报（理学版）》2020年第5期1093-1099,共7页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:11301410,11461038);陕西理工大学博士启动基金(批准号:SLGQD-1806).

摘　　要：删去完全图k 4任意一条边所得的图称为弦4-圈.利用权转移方法讨论限制度的IC-平面图中轻弦4-圈的权和,证明每个最小度至少为5且最小边度至少为11的IC-平面图含有一个轻弦4-圈v 1v 2v 3v 4v 1,并证明具有该类限制度的IC-平面图中轻弦4-圈权和的上界小于等于37.The graph formed by removing an edge from a complete graph k 4 was called chordal 4-cycle.By discharging method,the author discussed the weight of 4-cycle with chords in IC-planar graphs with degree restrictions.The author proved that each IC-planar graph with minimum vertex degree at least 5 and minimum edge degree at least 11 contained a light chordal 4-cycle v1v2v3v4v1,and proved that the upper bounds of weight of this kind of light chordal 4-cycle was at most 37.

关 键 词：IC-平面图 权转移方法 权和 弦4-圈 

分 类 号：O157.5[理学—数学]