Authors: Ilić, Aleksandar
Stevanović, Dragan 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: The Estrada index of chemical trees
Journal: Journal of Mathematical Chemistry
Volume: 47
Issue: 1
First page: 305
Last page: 314
Issue Date: 1-Jan-2010
Rank: M21
ISSN: 0259-9791
DOI: 10.1007/s10910-009-9570-0
Let G be a simple graph with n vertices and let λ1, λ2, . . ., λn be the eigenvalues of its adjacency matrix. The Estrada index of G is a recently introduced molecular structure descriptor, defined as, proposed as a measure of branching in alkanes. In order to support this proposal, we prove that among the trees with fixed maximum degree Δ, the broom Bn,Δ, consisting of a star SΔ+1 and a path of length n-Δ-1 attached to an arbitrary pendent vertex of the star, is the unique tree which minimizes even spectral moments and the Estrada index, and then show the relation EE(Sn) = EE(Bn,n-1) > EE(Bn,n-2) > . . . > EE(Bn,3) > EE(Bn,2) = EE(Pn). We also determine the trees with minimum Estrada index among the trees with perfect matching and maximum degree Δ. On the other hand, we strengthen a conjecture of Gutman et al. [Z. Naturforsch. 62a (2007), 495] that the Volkmann trees have maximal Estrada index among the trees with fixed maximum degree Δ, by conjecturing that the Volkmann trees also have maximal even spectral moments of any order. As a first step in this direction, we characterize the starlike trees which maximize even spectral moments and the Estrada index.
Keywords: Branching | Broom graph | Chemical trees | Estrada index | Spectral moments | Volkmann trees
Publisher: Springer Link
Project: Serbian Ministry of Science and Technological Development, Research Grants 144007 and 144015G
Slovenian Agency for Research, program P1-0285

Show full item record


checked on Jun 15, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.