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

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 1998年 / 283卷 / 1-3期

关键词：

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 条

[1] CHUNG F, 1996, C BOARD MATH SC
[2] Horn R. A., 1986, Matrix analysis
[3] A GRAPH-THEORETICAL APPROACH TO STRUCTURE PROPERTY RELATIONSHIPS
MIHALIC, Z
TRINAJSTIC, N
[J]. JOURNAL OF CHEMICAL EDUCATION, 1992, 69 (09) : 701 - 712
[4] ON THE SEARCH FOR THE BEST CORRELATION BETWEEN GRAPH-THEORETICAL INVARIANTS AND PHYSICOCHEMICAL PROPERTIES
MORALES, DA
ARAUJO, O
[J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 1993, 13 (02) : 95 - 106
[5] CHARACTERIZATION OF MOLECULAR BRANCHING
RANDIC, M
[J]. JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 1975, 97 (23) : 6609 - 6615
[6] SEARCH FOR USEFUL GRAPH THEORETICAL INVARIANTS OF MOLECULAR-STRUCTURE
RANDIC, M
HANSEN, PJ
JURS, PC
[J]. JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1988, 28 (02): : 60 - 68

← 1 →