Contents

-

Vertex and Edge Type Relations of Randic Index for Chemical Trees

Oswaldo Araujo1, Juan Rada1
1Departamento de Matemidticas, Facultad de Ciencias Universidad de Los Andes, 5101 Mérida, Venezuela

Abstract

Let T be a chemical tree, i.e. a tree with all vertices of degree less than or equal to 4. We find relations for the 0-connectivity and 1-connectivity indices 0χ(T) and 1χ(T), respectively, in terms of the vertices and edges of T. A comparison of these relations with the coefficients of the characteristic polynomial of T associated to its adjacency matrix is established.