Let G be a simple graph of order n. The Estrada index and Laplacian Estrada index of G are defined by EE(G)=∑ni=1eλi(A(G)) and LEE(G)=∑ni=1eλi(L(G)) , where λi(A(G))ni=1 and λi(L(G))ni=1 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.
|Number of pages||8|
|Publication status||Published - 1 Jul 2020|