Written for mathematicians working with the theory of graph spectra, this book explores more
than 400 inequalities for eigenvalues of the six matrices associated with finite simple graphs …

The Estrada index of a graph/network is defined as the trace of the adjacency matrix
exponential. It has been extended to other graph-theoretic matrices, such as the Laplacian …

Let G be a graph of order n. Let λ₁, λ₂.., λn be its eigenvalues and μ₁, μ₂.., μn its
Laplacian eigenvalues. The Estrada index of the graph G is defined as the sum of the terms …

If λi, i= 1, 2,..., n, are the eigenvalues of the graph G, then the Estrada index EE of G is the
sum of the terms eλi. This graph invariant appeared for the first time in year 2000, in a paper …

Let G be a graph with n vertices and let λ1, λ2,..., λn be its eigenvalues. The Estrada index of
G is EE (G)= n∑ i= 1 eλi. We present some lower and upper bounds for EE (G) in terms of …

If λi, i= 1, 2,..., n, are the eigenvalues of the graph G, then the Estrada index EE of G is the
sum of the terms e λi. This graph invariant appeared for the first time in year 2000, in a paper …

Let G be a graph with n vertices and let μ1, μ2,..., μn be its Laplacian eigenvalues. In some
recent works a quantity called Laplacian Estrada index was considered, defined as LEE (G) …

Suppose G is a graph and λ1, λ2,…, λn are the eigenvalues of G. The Estrada index EE (G)
of G is defined as the sum of [Formula: see text], 1≤ i≤ n. In this paper some new upper …

Bounds on the Estrada index of ISR (4,6)-fullerenes - ScienceDirect Skip to main contentSkip
to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full …

Suppose G is a simple graph. The ℓ-eigenvalues δ1, δ2,..., δn of G are the eigenvalues of its
normalized Laplacian ℓ. The normalized Laplacian Estrada index of the graph G is defined …