Lower Bounds of the Resolvent Estrada Indices for Line Graphs and Complementary Graphs
DOI:
https://doi.org/10.5890/DNC.2022.03.004Abstract
Let $G$ be a simple graph of order $n$. The resolvent Estrada index of $G$ is defined as $REE(G)=\sum_{i=1}^n {\frac{n-1}{n-1-\lambda _i }} $, where $\lambda _1 , \lambda _2 , \cdots , \lambda _n $ are the eigenvalues of the adjacency matrix $A(G)$. In this paper, we present several lower bounds of the resolvent Estrada indices for line graphs of any regular graphs and their complementary graphs.References
[1] Biggs, N. (1993), Algebraic Graph Theory, 2nd Edition, Cambridge Univ. Press, Cambridge.
[2] Chen, X. and Qian, J. (2012), Bounding the resolvent Estrada index of a graph, J. Math. Study, 45(2012), 159-166.
[3] Chen, X. and Qian, J. (2015), On resolvent Estrada index, J. Math Comput Chem, 73, 163-174.
[4] Estrada, E. and Rodríguez-Velázguez, J.A. (2005), Subgraph centrality in complex networks, Phys. Rev. E., 71, 056103-056103-9.
[5] Cvetkovi, D., Doob, M., and Sachs, H. (1980), Spectra of graphs-theory and application. Academic Press, New York.
[6] Ramane, H.S., Walikar, H.B., Rao, S.B., and Hampiholi, P.R. (2005), Spectra and energies of iterated line graphs of regular graphs, Appl. Math. Lett., 18(2005), 679-682.
Article Metrics
Usage tracked since September 1, 2026.