Calculating the edge Wiener and edge Szeged indices of graphs

被引:56
作者
Yousefi-Azari, H. [2 ]
Khalifeh, M. H. [2 ]
Ashrafi, A. R. [1 ]
机构
[1] Univ Kashan, Fac Sci, Dept Math, Kashan 8731751167, Iran
[2] Univ Tehran, Sch Math Stat & Comp Sci, Tehran, Iran
基金
美国国家科学基金会;
关键词
Edge Wiener index; Edge Szeged index; CARTESIAN PRODUCT GRAPHS; PI-INDEX; HEXAGONAL SYSTEMS; INVARIANTS; DISTANCE; VERTEX;
D O I
10.1016/j.cam.2011.02.019
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The edge Szeged and edge Wiener indices of graphs are new topological indices presented very recently. It is not difficult to apply a modification of the well-known cut method to compute the edge Szeged and edge Wiener indices of hexagonal systems. The aim of this paper is to propose a method for computing these indices for general graphs under some additional assumptions. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:4866 / 4870
页数:5
相关论文
共 22 条
[1]  
Ashrafi AR, 2006, UTILITAS MATHEMATICA, V71, P97
[2]  
Ashrafi AR, 2006, MATCH-COMMUN MATH CO, V55, P447
[3]   The Wiener index and the Szeged index of benzenoid systems in linear time [J].
Chepoi, V ;
Klavzar, S .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1997, 37 (04) :752-755
[4]   The edge-Wiener index of a graph [J].
Dankelmann, P. ;
Gutman, I. ;
Mukwembi, S. ;
Swart, H. C. .
DISCRETE MATHEMATICS, 2009, 309 (10) :3452-3457
[5]  
Deng HY, 2006, MATCH-COMMUN MATH CO, V55, P453
[6]  
Djokovic D.Z., 1973, J. Comb. Th. Ser. B, V14, P263, DOI [10.1016/0095-8956(73)90010-5, DOI 10.1016/0095-8956(73)90010-5]
[7]   Wiener index of hexagonal systems [J].
Dobrynin, AA ;
Gutman, I ;
Klavzar, S ;
Zigert, P .
ACTA APPLICANDAE MATHEMATICAE, 2002, 72 (03) :247-294
[8]   Wiener index of trees: Theory and applications [J].
Dobrynin, AA ;
Entringer, R ;
Gutman, I .
ACTA APPLICANDAE MATHEMATICAE, 2001, 66 (03) :211-249
[9]  
Gutman I, 2008, MATCH-COMMUN MATH CO, V60, P135
[10]   A novel PI index and its applications to QSPR/QSAR studies [J].
Khadikar, PV ;
Karmarkar, S ;
Agrawal, VK .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 2001, 41 (04) :934-949