A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Seidel-Estrada index
2016
Journal of Inequalities and Applications
Preserved Fulltext
Let G be a simple graph with n vertices and (0, 1)-adjacency matrix A. As usual, S(G) = J -2A -I denotes the Seidel matrix of the graph G. Suppose are the eigenvalues of the adjacency matrix and the Seidel matrix of G, respectively. The Estrada index of the graph G is defined as n i=1 e θ i . We define and investigate the Seidel-Estrada index, SEE = SEE(G) = n i=1 e λ i . In this paper the basic properties of the Seidel-Estrada index are investigated. Moreover, some lower and upper bounds for
doi:10.1186/s13660-016-1061-9
fatcat:gs3bmobmdraghbv77wt6xsqhqe