be a simple graph of order n
. The Estrada index and Laplacian Estrada index of G
are defined by
are the eigenvalues of its adjacency and Laplacian matrices, respectively. In this paper, we establish almost sure upper bounds and lower bounds for random interdependent graph model, which is fairly general encompassing Erdös-Rényi random graph, random multipartite graph, and even stochastic block model. Our results unravel the non-triviality of interdependent edges between different constituting subgraphs in spectral property of interdependent graphs.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited