| 一个关于余直径的度条件 |
| |
| 引用本文： | 贾振声,朱永津.一个关于余直径的度条件[J].系统科学与数学,2003,23(1):100-108. |
| |
| 作者姓名： | 贾振声 朱永津 |
| |
| 作者单位： | 1. 太原理工大学理学院数学系,太原,030024
2. 中国科学院系统科学研究所,北京,100080 |
| |
| 摘 要： | 本文研究关于余直径的度条件,主要结果是,若G是3-连通图,其顶点集为V(G)={v1,v2,…,vn),其度序列为: d(v1)≤d(v2)≤…≤d(vn)则对G的任意一条边e都存在特征点对va,vb,使G中过e的最长圈至少为d(va)+d(vb)-1.在相同的条件下我们有d*(G)≥ m-2,
|
| 关 键 词： | 图 圈 路 特征点对 余直径 |
| 修稿时间： | 2000年1月18日 |
A DEGREE CONDITION FOR CODIAMETER |
| |
| Zhen Sheng JIA,Yong Jin ZHU.A DEGREE CONDITION FOR CODIAMETER[J].Journal of Systems Science and Mathematical Sciences,2003,23(1):100-108. |
| |
| Authors: | Zhen Sheng JIA Yong Jin ZHU |
| |
| Institution: | (1)Taiyuan University of Technology, Taiyuan 030024,P.R.CHina;(2)Institute of Systems Science, Chinese Academy of Sciences Beijing 100080,P.R.CHina |
| |
| Abstract: | In this paper, a degree condition for codiameter is presented. The main result is as follows: let G be a 3-connected graph with the vertices set V(G) = {vi,v2, ,vn} and the degree sequence satisfying d(v1) < d(v2)< d(vn). Then, for any edge e, exists a pair of characteristic points va and Vb such that the length of the longest cycle passing through e at least d(va) + d(vi,) - 1. Under the same conditions, we have that d(G) > m - 2. |
| |
| Keywords: | Graph cycle path a pair of characteristic vertices codiameter |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 |
|
