Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
Xueliang Li, Yiyang Li, Zhiqian Wang

TL;DR
This paper investigates the asymptotic behavior of four Laplacian-type energies for matrices with degree-distance-based entries in random graphs, generalizing a conjecture and providing explicit asymptotic values.
Contribution
It introduces four weighted Laplacian energies for random graphs and derives their asymptotic values, extending previous conjectures to a broader class of matrices.
Findings
Asymptotic values for two of the energies are obtained.
For almost all graphs, the energy of the degree-distance matrix is less than the Laplacian energy.
The results generalize a conjecture by Gutman et al.
Abstract
Let be a real function symmetric in and with the property that for . Let be a graph, denote the degree of a vertex of and denote the distance between vertices and in . In this paper, we define the -weighted Laplacian matrix for random graphs in the Erds-Rnyi random graph model , where is fixed. Four weighted Laplacian type energies: the weighted Laplacian energy , weighted signless Laplacian energy , weighted incidence energy and the weighted Laplacian-energy like invariant are introduced and studied. We obtain the asymptotic values of and , and the values of and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Topological and Geometric Data Analysis · Random Matrices and Applications
