%0 Journal Article
%T A DEGREE CONDITION FOR CODIAMETER<br>一个关于余直径的度条件
%A Zhen Sheng JIA
%A Yong Jin ZHU
%A <br>贾振声
%A 朱永津
%J 系统科学与数学
%D 2003
%I 
%X 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.
%K Graph
%K cycle
%K path
%K a pair of characteristic vertices
%K codiameter<br>图
%K 圈
%K 路
%K 特征点对
%K 余直径
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=4494A4A87CB215D5&yid=D43C4A19B2EE3C0A&vid=EA389574707BDED3&iid=CA4FD0336C81A37A&sid=8C83C265AD318E34&eid=6270DC1B5693DDAF&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=2