Randic Spectral Radius and Randic Energy
No Thumbnail Available
Date
2010
Journal Title
Journal ISSN
Volume Title
Publisher
Univ Kragujevac, Fac Science
Access Rights
info:eu-repo/semantics/closedAccess
Abstract
Let G be a simple connected graph with n vertices and let d(i) be the degree of its i-th vertex. The Randic matrix of G is the square matrix of order n whose (i, j)-entry is equal to 1/root d(i)d(j) di if the i-th and j-th vertex of G are adjacent, and zero otherwise. The Randic eigenvalues are the eigenvalues of the Rancho matrix. The greatest Randic eigenvalue is the Randic spectral radius of C. The Randic energy is the sum of the absolute values of the Randic eigenvalues. Lower bounds for Randic spectral radius and an upper bound for Randic energy are obtained. Graphs for which these bounds are best possible are characterized.
Description
Keywords
Journal or Series
Match-Communications in Mathematical and in Computer Chemistry
WoS Q Value
Q1
Scopus Q Value
Q1
Volume
64
Issue
2
Citation
Bozkurt, Ş. B., Güngör, A. D., Gutman, I., (2010). Randic Spectral Radius and Randic Energy. Match-Communications in Mathematical and in Computer Chemistry, 64(2), 321-334.
