| 限制度的IC平面图中轻弦4-圈的权和 |
| |
| 引用本文： | 田京京.限制度的IC平面图中轻弦4-圈的权和[J].吉林大学学报(理学版),2020,58(5):1093-1099. |
| |
| 作者姓名： | 田京京 |
| |
| 作者单位： | 陕西理工大学 数学与计算机科学学院, 陕西 汉中 723000 |
| |
| 基金项目： | 博士启动基金;国家自然科学基金 |
| |
| 摘 要： | 删去完全图k4任意一条边所得的图称为弦4-圈. 利用权转移方法讨论限制度的IC-平面图中轻弦4-圈的权和, 证明每个最小度至少为5且最小边度至少为11的IC-平面图含有一个轻弦4-圈v1v2v3v4v1, 并证明具有该类限制度的IC-平面图中轻弦4-圈权和的上界小于等于37.
|
| 关 键 词： | IC-平面图 权转移方法 权和 弦4-圈 |
| 收稿时间： | 2020-03-27 |
Weight of Light Chords 4-Cycles in IC-Planar Graphs with Degree Restrictions |
| |
| TIAN Jingjing.Weight of Light Chords 4-Cycles in IC-Planar Graphs with Degree Restrictions[J].Journal of Jilin University: Sci Ed,2020,58(5):1093-1099. |
| |
| Authors: | TIAN Jingjing |
| |
| Institution: | School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong 723000, Shaanxi Province, China |
| |
| Abstract: | The graph formed by removing an edge from a complete graph k4 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. |
| |
| Keywords: | IC-planar graph discharging method weight chordal 4-cycle |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
