Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs

preprint2020arXivOpen access

Abstract

Let f(D(i,j),di,dj)f(D(i, j), d_i, d_j) be a real function symmetric in ii and jj with the property that f(d,(1+o(1))np,(1+o(1))np)=(1+o(1))f(d,np,np)f(d, (1+o(1))np, (1+o(1))np)=(1+o(1))f(d, np, np) for d=1,2d=1,2. Let GG be a graph, did_i denote the degree of a vertex ii of GG and D(i,j)D(i, j) denote the distance between vertices ii and jj in GG. In this paper, we define the ff-weighted Laplacian matrix for random graphs in the Erdo¨\ddot{o}s-Reˊ\acute{e}nyi random graph model Gn,p\mathcal{G}_{n, p}, where p∈(0,1)p\in (0, 1) is fixed. Four weighted Laplacian type energies: the weighted Laplacian energy LEf(G)\mathscr{LE}_f(G), weighted signless Laplacian energy LEf+(G)\mathscr{LE}^{+}_f(G), weighted incidence energy IEf(G)\mathscr{IE}_f(G) and the weighted Laplacian-energy like invariant LELf(G)\mathscr{LEL}_f(G) are introduced and studied. We obtain the asymptotic values of IEf(G)\mathscr{IE}_f(G) and LELf(G)\mathscr{LEL}_f(G), and the values of LEf(G)\mathscr{LE}_f(G) and LEf+(G)\mathscr{LE}_f^{+}(G) under the condition that f(D(i,j),di,dj)f(D(i, j), d_i, d_j) is a function dependent only on D(i,j)D(i, j). As a consequence, we get that for almost all graphs Gp∈Gn,pG_p\in \mathcal{G}_{n, p}, the energy for the matrix with degree-distance-based entries of GpG_p, E(Wf(Gp))<LEf(Gp),\mathscr{E}(W_f(G_p)) < \mathscr{LE}_f(G_p), the Laplacian energy of the matrix, which is a generalization of a conjecture by Gutman et al.

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.