摘要
根据图的直径大小,通过对图H联系数集的分析,证明了顶点数ν≤7的A(H)=3图是惟一的,即肯定了满足A(H)=3最小图的惟一性.
According to the diameter fo the graphs, in this paper, we prove graphs with ν≤7 and A(H)=3 is unique, through analyzing the eccentricity set of graphs.
出处
《哈尔滨理工大学学报》
CAS
2003年第5期13-15,共3页
Journal of Harbin University of Science and Technology
