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

preprint2020arXivOpen access

Abstract

For a graph G=(V,E)G=(V, E) and i,j∈Vi, j\in V, denote the distance between ii and jj in GG by D(i,j)D(i, j) and the degrees of ii, jj by did_i, djd_j, respectively. Let f(D(i,j),di,dj)f(D(i, j), d_{i}, d_{j}) be a function symmetric in ii and jj. Define a matrix Wf(G)W_f(G), called the weighted distance matrix, of GG, with the ijij-entry Wf(G)(i,j)=f(D(i,j),di,dj)W_f(G)(i, j)=f(D(i, j), d_{i}, d_{j}) if i≠ji\neq j and Wf(G)(i,j)=0W_f(G)(i, j)=0 if i=ji=j. In this paper, we prove that if the symmetric function ff satisfies that f(D(i,j),(1+o(1))np,(1+o(1))np)=(1+o(1))f(D(i,j),np,np)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 GpG_p in the Erdo¨sErd\ddot{o}s-ReˊnyiR\acute{e}nyi random graph model Gn,p\mathcal{G}_{n, p}, the energy of Wf(Gp)W_f(G_p) is {(83πp(1−p)+o(1))⋅∣f(1,np,np)−f(2,np,np)∣+o(∣f(2,np,np)∣)}⋅n3/2\{(\frac{8}{3π}\sqrt{p(1-p)}+o(1))\cdot|f(1, np, np)-f(2, np, np)|+o(|f(2, np, np)|)\}\cdot n^{3/2}. As a consequence, we give the asymptotic values of energies of a variety of weighted distance matrices with function ff 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.