A DEGREE CONDITION FOR CODIAMETER
一个关于余直径的度条件

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.