The asymptotic value of graph energy for random graphs with degree-based weights
From MaRDI portal
(Redirected from Publication:777425)
Abstract: In this paper, we investigate the energy of a weighted random graph in , in which each edge takes the weight , where is a random variable, the degree of vertex in the random graph of the Erd"{o}s--R'{e}nyi random graph model , and is a symmetric real function on two variables. Suppose for some constants , and . Then, for almost all graphs in , the energy of is where is any fixed and independent of . Consequently, with this one basket we can get the asymptotic values of various kinds of graph energies of chemical use, such as Randi'c energy, ABC energy, and energies of random matrices obtained from various kinds of degree-based chemical indices.
Recommendations
- The asymptotic value of energy for matrices with degree-distance-based entries of random graphs
- Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
- Energy, Randić index and maximum degree of graphs
- The energy of random graphs
- Various energies of random graphs
Cites work
- scientific article; zbMATH DE number 51346 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 1347881 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Characteristic vectors of bordered matrices with infinite dimensions
- Eigenvalue distribution of large weighted random graphs
- Graph energy
- Graph energy
- Lanzhou index
- Limit laws for random matrices and free products
- Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
- On Randić energy
- On relation between energy and Laplacian energy
- On structure-sensitivity of degree-based topological indices
- On the distribution of the roots of certain symmetric matrices
- Orthogonal polynomials and random matrices: a Riemann-Hilbert approach.
- Random graphs.
- Relation between energy and Laplacian energy
- Spectral measure of large random Hankel, Markov and Toeplitz matrices
- The Laplacian energy of random graphs
- The eigenvalues of random symmetric matrices
- The energy of graphs and matrices
Cited in
(8)- The energy of random graphs
- Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property \(P^*\)
- Some Degree-Based Topological Indices and (Normalized Laplacian) Energy of Graphs
- Extremal problems for graphical function-indices and \(f\)-weighted adjacency matrix
- Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices
- The asymptotic value of energy for matrices with degree-distance-based entries of random graphs
- Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
- A relation between a vertex-degree-based topological index and its energy
This page was built for publication: The asymptotic value of graph energy for random graphs with degree-based weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777425)