The m-connectivity index of graphs.pdf

The m-connectivity index of graphs ? Hao Li? Mei Lu? Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China (Received November 29, 2004) Abstract m The m-connectivity index χα(G) of an organic molecule whose molecular graph is G is α the sum of the weights (di1 di2 ...dim+1 ) , where i1 ?i2 ?...?im+1 runs over all paths of length m m in G and di denotes the degree of vertex vi. We ?nd upper bounds for χα(G) when m ≥ 1 and α ≥ ?1 (α 6= 0) using the eigenvalues of the Laplacian matrix of an associated weighted graph. 1 Introduction The connectivity index of an organic molecule whose molecular graph is G is de?ned (see [4] [11]) as X 1 α χα(G) = (d(u)d(v)) u,v where d(u) denotes the degree of the vertex u of the molecular graph G, where the summation goes over all pairs of adjacent vertices of G and where α (α 6= 0) is a pertinently chosen 1 exponent. In 1975, Randi′cintroduced the respective structure-descriptor in [11] for α = ? 2 (which he called the branching index, and is now also called the Randi′cindex) in his study of alkanes. The Randi′cindex has been closely correlated with many chemical properties (see [7]). However, other choices of α were also considered, and the exponent α was treated (see [2, 3, 13]) 1 as an adjustable parameter, chosen so as to optimize the correlation between χα and some selected class