The connectivity index of a weighted graph

dc.contributor.author	Araujo, O
dc.contributor.author	de la Pena, JA
dc.date.accessioned	2011-01-22T10:27:46Z
dc.date.available	2011-01-22T10:27:46Z
dc.date.issued	1998
dc.identifier.issn	0024-3795
dc.identifier.uri	http://hdl.handle.net/11154/2748
dc.description.abstract	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.	en_US
dc.language.iso	en	en_US
dc.title	The connectivity index of a weighted graph	en_US
dc.type	Article	en_US
dc.identifier.idprometeo	2794
dc.source.novolpages	283(40603):171-177
dc.subject.wos	Mathematics, Applied
dc.description.index	WoS: SCI, SSCI o AHCI
dc.relation.journal	Linear Algebra and Its Applications