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

DOI10.1016/J.DAM.2020.04.008zbMATH Open1443.05115arXiv1904.13346OpenAlexW3016344096MaRDI QIDQ777425

Jiarong Song, Xueliang Li, Yiyang Li

Publication date: 7 July 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: In this paper, we investigate the energy of a weighted random graph $G_p(f)$ in $G_{n,p}(f)$, in which each edge $ij$ 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"{o}s--R'{e}nyi random graph model $G_{n,p}$, and $f$ is a symmetric real function on two variables. Suppose $|f(d_i,d_j)|leqC{n}^m$ for some constants $C,m>0$, and $f((1+o(1))np,(1+o(1))np)=(1+o(1))f(np,np)$. Then, for almost all graphs $G_p(f)$ in $G_{n,p}(f)$, the energy of $G_p(f)$ is $(1+o(1))f(np,np)frac83pisqrtp(1-p)cdot{n}^{3/2},$ where $pin(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'c energy, ABC energy, and energies of random matrices obtained from various kinds of degree-based chemical indices.

Full work available at URL: https://arxiv.org/abs/1904.13346

zbMATH Keywords

eigenvaluestopological indicesgraph energiesweighted random graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Random matrices (algebraic aspects) (15B52) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Signed and weighted graphs (05C22)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The eigenvalues of random symmetric matrices
• Graph Energy
• The energy of graphs and matrices
• Graph energy
• Random graphs.
• Orthogonal polynomials and random matrices: a Riemann-Hilbert approach.
• On structure-sensitivity of degree-based topological indices
• Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
• Characteristic vectors of bordered matrices with infinite dimensions
• Limit laws for random matrices and free products
• Eigenvalue distribution of large weighted random graphs
• On the distribution of the roots of certain symmetric matrices
• Spectral measure of large random Hankel, Markov and Toeplitz matrices
• The Laplacian energy of random graphs
• On Randić energy

Cited In (7)

• 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
• 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
• Extremal Problems for Graphical Function-Indices and f-Weighted Adjacency Matrix
• 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)