Applications of Estrada indices and energy to a family of compound graphs

Abstract To track the gradual change of the adjacency matrix of a simple graph G into the signless Laplacian matrix, V. Nikiforov in [35] suggested the study of the convex linear combination A α ( α-adjacency matrix ), A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) , for α ∈ [ 0 , 1 ] , where A ( G ) and D ( G ) are the adjacency and the diagonal vertex degrees matrices of G , respectively. Taking this definition as an idea the next matrix was considered for a , b ∈ R . The matrix A a , b defined by A a , b ( G ) = a D ( G ) + b A ( G ) , extends the previous α -adjacency matrix. This matrix is designated the ( a , b ) -adjacency matrix of G . Both adjacency matrices are examples of universal matrices already studied by W. Haemers. In this paper, we study the ( a , b ) -adjacency spectra for a family of compound graphs formed by disjoint balanced trees whose roots are identified to the vertices of a given graph. In consequence, new families of cospectral (adjacency, Laplacian and signless Laplacian) graphs, new hypoenergetic graphs (graphs whose energy is less than its vertex number) and new explicit formulae for Estrada, signless Laplacian Estrada and Laplacian Estrada indices of graphs were obtained. Moreover, sharp upper bounds of the above indices for caterpillars, in terms of length of the path and of the maximum number of its pendant vertices, are given.