摘要
图G=(V,E)是简单连通图,其中V和E为图G的顶点集和边集.图G的Wiener指数W(G),是指图中所有顶点对之间的距离之和,即W(G)=∑,{uv}■V(G) dG(u,v).文章给出了路的平方P2以及圈的平方C2的Wiener指数.
Graph G =(V,E) is a simple graph,V is vertex set,E is edge set.W(G),is graph G,distance between two different points,that is W(G) = ∑d(i,j)(i,j) ∈ V,the text show will us Winer index of P and C.W(P2),W(C2) are also included
出处
《淮北师范大学学报(自然科学版)》
CAS
2012年第4期6-8,共3页
Journal of Huaibei Normal University:Natural Sciences
基金
国家自然科学基金项目(10301010)