The asymptotic value of energy for matrices with degree-distance-based entries of random graphs

From MaRDI portal
Publication:2197147

DOI10.1016/J.LAA.2020.06.020zbMATH Open1446.05059arXiv2002.10694OpenAlexW3009289675MaRDI QIDQ2197147FDOQ2197147

Yiyang Li, Zhiqian Wang, Xueliang Li

Publication date: 28 August 2020

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: For a graph G=(V,E) and i,jinV, denote the distance between i and j in G by D(i,j) and the degrees of i, j by di, dj, respectively. Let f(D(i,j),di,dj) be a function symmetric in i and j. Define a matrix Wf(G), called the weighted distance matrix, of G, with the ij-entry Wf(G)(i,j)=f(D(i,j),di,dj) if ieqj and Wf(G)(i,j)=0 if i=j. In this paper, we prove that if the symmetric function f satisfies that f(D(i,j),(1+o(1))np,(1+o(1))np)=(1+o(1))f(D(i,j),np,np), then for almost all graphs Gp in the Erdddotos-Racuteenyi random graph model mathcalGn,p, the energy of Wf(Gp) is (frac83pisqrtp(1p)+o(1))cdot|f(1,np,np)f(2,np,np)|+o(|f(2,np,np)|)cdotn3/2. As a consequence, we give the asymptotic values of energies of a variety of weighted distance matrices with function f from distance-based only and mixed with degree-distance-based topological indices of chemical use. This generalizes our former result with only degree-based weights.


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




Recommendations




Cites Work


Cited In (6)





This page was built for publication: The asymptotic value of energy for matrices with degree-distance-based entries of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197147)