The connectivity index of a weighted graph

被引:54
作者
Araujo, O
de la Pena, JA
机构
[1] Natl Autonomous Univ Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
[2] Univ Los Andes, Fac Ciencias, Dept Math, Merida 5101, Venezuela
关键词
D O I
10.1016/S0024-3795(98)10096-4
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let G be a simple graph and consider the m-connectivity index (m)chi(G) = Sigma(i1-i2-...-im+1) 1/root d(i1)d(i2)...d(im+1), where i(1) - i(2) - ...- i(m+1) runs over all paths of length m in G and d(i) denotes the degree of the vertex i. We find upper bounds for (m)chi(G) using the eigenvalues of the Laplacian matrix of an associated weighted graph. The method provides also lower bounds for (1)chi(G). (C) 1998 Elsevier Science Inc. All rights reserved.
引用
收藏
页码:171 / 177
页数:7
相关论文
共 6 条