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

DOI10.1016/J.LAA.2020.11.005zbMATH Open1459.05179arXiv2007.13059OpenAlexW3106256621MaRDI QIDQ2228530FDOQ2228530

Xueliang Li, Yiyang Li, Zhiqian Wang

Publication date: 17 February 2021

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

Abstract: Let $f(D(i,j),d_i,d_j)$ be a real function symmetric in $i$ and $j$ with the property that $f(d,(1+o(1))np,(1+o(1))np)=(1+o(1))f(d,np,np)$ for $d=1,2$. Let $G$ be a graph, $d_i$ denote the degree of a vertex $i$ of $G$ and $D(i,j)$ denote the distance between vertices $i$ and $j$ in $G$. In this paper, we define the $f$-weighted Laplacian matrix for random graphs in the Erd$ddoto$s-R$acutee$nyi random graph model $mathcal{G}_{n,p}$, where $pin(0,1)$ is fixed. Four weighted Laplacian type energies: the weighted Laplacian energy $mathscr{LE}_f(G)$, weighted signless Laplacian energy $mathscr{LE}_f^{+}(G)$, weighted incidence energy $mathscr{IE}_f(G)$ and the weighted Laplacian-energy like invariant $mathscr{LEL}_f(G)$ are introduced and studied. We obtain the asymptotic values of $mathscr{IE}_f(G)$ and $mathscr{LEL}_f(G)$, and the values of $mathscr{LE}_f(G)$ and $mathscr{LE}_f^{+}(G)$ under the condition that $f(D(i,j),d_i,d_j)$ is a function dependent only on $D(i,j)$. As a consequence, we get that for almost all graphs $G_{p}inmathcal{G}_{n,p}$, the energy for the matrix with degree-distance-based entries of $G_p$, $mathscrE(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.

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

Recommendations

• The asymptotic value of energy for matrices with degree-distance-based entries of random graphs
• The asymptotic value of graph energy for random graphs with degree-based weights
• The Laplacian energy of random graphs
• The Laplacian energy and Laplacian Estrada index of random multipartite graphs
• Spectral distributions of adjacency and Laplacian matrices of random graphs
• Empirical distributions of Laplacian matrices of large dilute random graphs
• Random matrices with row constraints and eigenvalue distributions of graph Laplacians
• Low eigenvalues of Laplacian matrices of large random graphs
• Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős-Rényi random graphs
• Laplacian spectral moment and Laplacian Estrada index of random graphs

zbMATH Keywords

random graphasymptotic valueincidence energyLaplacian energysignless Laplacian energychemical indicesLaplacian-energy like invariant

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Cites Work

• Asymptotic Statistics
• The eigenvalues of random symmetric matrices
• Graph Energy
• Title not available (Why is that?)
• Additively weighted Harary index of some composite graphs
• Incidence energy of a graph
• On the reciprocal degree distance of graphs
• Paths in graphs
• Title not available (Why is that?)
• On structure-sensitivity of degree-based topological indices
• Characteristic vectors of bordered matrices with infinite dimensions
• Laplacian energy of a graph
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• On incidence energy of a graph
• Title not available (Why is that?)
• Degree-based energies of graphs
• The asymptotic value of graph energy for random graphs with degree-based weights
• The asymptotic value of energy for matrices with degree-distance-based entries of random graphs
• Some lower bounds for Laplacian energy of graphs

Cited In (6)

• Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property \(P^*\)
• Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices
• Leap eccentric connectivity index in graphs with universal vertices
• Extremal Problems for Graphical Function-Indices and f-Weighted Adjacency Matrix
• A relation between a vertex-degree-based topological index and its energy
• Delta invariant for Eulerian digraphs

This page was built for publication: Asymptotic values of four Laplacian-type energies 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 Q2228530)