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

DOI10.1016/J.LAA.2020.06.020MaRDI QIDQ2197147zbMATH OpenOpenAlexFDO

Authors Zhiqian Wang, Xueliang Li, Yiyang Li

Publication date 28 August 2020

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

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

zbMATH Keywords

random graphasymptotic valuegraph energychemical indices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Signed and weighted graphs (05C22) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

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 $d_i$, $d_j$, respectively. Let $f(D(i,j),d_i,d_j)$ be a function symmetric in $i$ and $j$. Define a matrix $W_f(G)$, called the weighted distance matrix, of $G$, with the $ij$-entry $W_f(G)(i,j)=f(D(i,j),d_i,d_j)$ if $ieqj$ and $W_f(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 $G_p$ in the $Erdddotos$-$Racuteenyi$ random graph model $mathcal{G}_{n,p}$, the energy of $W_f(G_p)$ is $(frac83pisqrtp(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 $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.

Recommendations

• Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
• The asymptotic value of graph energy for random graphs with degree-based weights
• Bounds for the distance energy of a graph
• The energy of random graphs
• Various energies of random graphs

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3623599 (Why is no real title available?)
• Additively weighted Harary index of some composite graphs
• Asymptotic Statistics
• Characteristic vectors of bordered matrices with infinite dimensions
• Degree distance and minimum degree
• Degree distance and vertex-connectivity
• Degree distance of unicyclic graphs with given matching number
• Degree-based energies of graphs
• Extremal \((n,m)\)-graphs with respect to distance-degree-based topological indices
• Graph energy
• Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
• On structure-sensitivity of degree-based topological indices
• On the distribution of the roots of certain symmetric matrices
• On the reciprocal degree distance of graphs
• Paths in graphs
• The Laplacian energy of random graphs
• The asymptotic value of graph energy for random graphs with degree-based weights
• The energy of random graphs
• Various energies of random graphs

Cited in

(7)

• Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property \(P^*\)
• Extremal problems for graphical function-indices and \(f\)-weighted adjacency matrix
• Energies of complements of unitary one-matching bi-Cayley graphs over commutative rings
• Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices
• Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
• The asymptotic value of graph energy for random graphs with degree-based weights
• A relation between a vertex-degree-based topological index and its energy

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)