摘要
如果非平凡连通图G中任意的顶点v都对应G中唯一的顶点,使d(v,)=diam(G),则称G为平衡图.若平衡图G中由边uv∈B(G)可推出∈B(G),则称G为调和平衡图.本文证明了顶点数为n直径为d(d≥5)的调和平衡图G当G≌C_n时有关系式n≥3d.
A nontrivial connected graph G is called even if for each vertex v of G there is an unique vertex such that d(v, )=diam(G).In particular,an even graph G is called harmonic if ∈E(G) whenever uv∈ E(G).For a harmonic even graph other than an even cycle of order n and diameter d(d≥5) it is shown that n≥3d.
出处
《内蒙古大学学报(自然科学版)》
CAS
CSCD
1992年第1期32-36,共5页
Journal of Inner Mongolia University:Natural Science Edition
关键词
调和平衡图
直径
顶点数
连通图
even graph
harmonic even graph
diameter
order
connected graph