NEW SUFFICIENT CONDITIONS OF THE LONGEST CYCLES OF 1-TOUGH GRAPHS  

作　　者：田永成 

机构地区：[1]Department of Mathematics, Northeast Institute of Technology, Shengyang 110006, PRC

出　　处：《Chinese Science Bulletin》1991年第3期261-262,共2页

摘　　要：In this letter all graphs will be finite, undirected simple graphs. Let G be a graph. We shall use V(G), E and c(G) to denote the vertex set, the edge set and the circumference of G respectively. We denote the distance between u and v by d(u, v). Let p=V(G).

关 键 词：undirected VERTEX LETTER CONNECTED CIRCUMFERENCE 孟玉 孟之 公之 

分 类 号：N[自然科学总论]