The asymptotic value of graph energy for random graphs with degree-based weights.

In this paper, we investigate the energy of a weighted random graph G p (f) in G n , p (f) , in which each edge i j takes the weight f (d i , d j) , where d v is a random variable, the degree of vertex v in the random graph G p of the Erdös–Rényi random graph model G n , p , and f is a symmetric real function on two variables. Suppose | f (d i , d j) | ≤ C n m for some constants C , m > 0 , and f ((1 + o (1)) n p , (1 + o (1)) n p) = (1 + o (1)) f (n p , n p). Then, for almost all graphs G p (f) in G n , p (f) , the energy of G p (f) is (1 + o (1)) f (n p , n p) 8 3 π p (1 − p) ⋅ n 3 ∕ 2 , where p ∈ (0 , 1) is any fixed and independent of n. Consequently, with this one basket we can get the asymptotic values of various kinds of graph energies of chemical use, such as Randić energy, ABC energy, and energies of random matrices obtained from various kinds of degree-based chemical indices. [ABSTRACT FROM AUTHOR]