| 简单图中圈的长度 |
| |
| 引用本文： | 廖江东,黄勇庆.简单图中圈的长度[J].蒙自师范高等专科学校学报,2007,5(2):8-9. |
| |
| 作者姓名： | 廖江东 黄勇庆 |
| |
| 作者单位： | 重庆师范大学数学与计算机科学学院 重庆400047 |
| |
| 摘 要： | n阶简单图G,满足e∈E(G),e=uv,使得d(u)+d(v)≥n,在这篇文章里我们证明了图G的周长可以用图G的某些参数表示出来;并且当图G不是完全二部图时,证明了图G包含了长度为3到周长的所有圈.
|
| 关 键 词： | 度的和 周长 泛圈图 闭包 Hamilton图 |
| 文章编号： | 1008-9128（2007）02-0008-02 |
| 修稿时间： | 2006-12-30 |
Cycle Lengths of Simple Graphs |
| |
| LIAO Jiang-dong,HUANG Yong-qing.Cycle Lengths of Simple Graphs[J].Journal of Mengzi Teachers' College,2007,5(2):8-9. |
| |
| Authors: | LIAO Jiang-dong HUANG Yong-qing |
| |
| Institution: | College of Mathematics and Computer Science, Chongqing Normal University, Chongqing 400047, China |
| |
| Abstract: | Let G be a simple graph of order n satisfying for every edge uv of G.We show that the circumference of G can be expressed in terms of a certain graph parameter.Moreover,we show that G contains cycles of every length between 3 and the circumference,unless G is complete bipartite. |
| |
| Keywords: | degree sum circumference pancyclic graph closure cycle hamiltonian graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
