A graph-level spectral invariant derived from subgraph centrality:
$$EE(G) = \sum_{i=1}^{n} e^{\lambda_i}$$
where \(\lambda_i\) are the eigenvalues of the adjacency matrix. The
Estrada index equals the total number of closed walks in the graph,
weighted by walk length: \(EE(G) = \sum_k M_k / k!\) where \(M_k\) is
the number of closed walks of length \(k\). It is the sum of subgraph
centralities across all nodes.
Usage
estrada_index(x)
Value
A single numeric value — the Estrada index of the graph.