| 不含4圈的最大简单图边数的下界 |
| |
| 引用本文： | 侯亚君,高峰.不含4圈的最大简单图边数的下界[J].沈阳理工大学学报,1993(1). |
| |
| 作者姓名： | 侯亚君 高峰 |
| |
| 作者单位： | 沈阳工业学院基础课部，沈阳工业学院管理工程系 |
| |
| 摘 要： | 证明了具有不小于6个顶点的不包含4圈的简单图的最大可能边数的下界是2n-5。
|
| 关 键 词： | 图论 k圈 路 连通图 |
Lower Limit of Maximum Edges for Simple Configuration Without 4 Contours |
| |
| Hou Yajun,Gao Feng Basic curses Dept. Management Engineering Dept..Lower Limit of Maximum Edges for Simple Configuration Without 4 Contours[J].Transactions of Shenyang Ligong University,1993(1). |
| |
| Authors: | Hou Yajun Gao Feng Basic curses Dept Management Engineering Dept |
| |
| Affiliation: | Hou Yajun;Gao Feng Basic curses Dept. Management Engineering Dept. |
| |
| Abstract: | This paper proves that the lover limit of the maximum number of edges for a simple configuration with n vertexes and arbitrary contours except 4 is 2n - 5,where n is no less than 6. |
| |
| Keywords: | graph theory k loop/loop path connectea graphs |
| 本文献已被 CNKI 等数据库收录！ |
