Wiener index of some graphs

被引:0
作者
Yazdani, Javad [1 ]
机构
[1] Kermanshah Univ Technol, Nanotechnol Lab, Kermanshah, Iran
来源
ICMS: INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCE | 2010年 / 1309卷
关键词
molecular graphs; Wiener index; Distance in graphs;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Let G be a molecular graph. The distance d(u,v) between the vertices u and v of the graph G is equal to the length of a shortest path that connects u and v. the wiener index W (G) is the sum of all distances between vertices of G. In this paper the wiener index of some graphs are determined.
引用
收藏
页码:923 / 926
页数:4
相关论文
共 10 条