Affiliation:
1. School of Science, Zhejiang University of Science and Technology, Hangzhou 310023, China
Abstract
Let G be a graph of order n and L(G) be its Laplacian matrix. The Laplacian polynomial of G is defined as P(G;λ)=det(λI−L(G))=∑i=0n(−1)ici(G)λn−i, where ci(G) is called the i-th Laplacian coefficient of G. Denoted by Gn,m the set of all (n,m)-graphs, in which each of them contains n vertices and m edges. The graph G is called uniformly minimal if, for each i(i=0,1,…,n), H is ci(G)-minimal in Gn,m. The Laplacian matrix and eigenvalues of graphs have numerous applications in various interdisciplinary fields, such as chemistry and physics. Specifically, these matrices and eigenvalues are widely utilized to calculate the energy of molecular energy and analyze the physical properties of materials. The Laplacian-like energy shares a number of properties with the usual graph energy. In this paper, we investigate the existence of uniformly minimal graphs in Gn,m because such graphs have minimal Laplacian-like energy. We determine that the c2(G)-c3(G) successive minimal graph is exactly one of the four classes of threshold graphs.
Funder
the Natural Science Foundation of Zhejiang Province
the National Natural Science Foundation of China
Graduate Research and Innovation Fund of Zhejiang University of Science and Technology
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis
Reference32 articles.
1. Kirchhoff indices and numbers of spanning trees of molecular graphs derived from linear crossed polyomino chain;Pan;Polycycl. Aromat. Compd.,2021
2. Klyukin, I.N., Kolbunova, A.V., and Novikov, A.S. (2022). Theoretical Insight into B–C Chemical Bonding in Closo-Borate [BnHn−1CH3]2−(n=6,10,12) and Monocarborane [CBnHnCH3]−(n=5,9,11) Anions. Inorganics, 10.
3. Drake, R. (2022). Benchmark of Clustering Techniques and Potential Applications to Polymer Material Science, Liberty University.
4. Perturbation of the normalized Laplacian matrix for the prediction of missing links in real networks;Aliakbarisani;IEEE Trans. Netw. Sci. Eng.,2021
5. Cuadra, L., and Nieto-Borge, J.C. (2021). Modeling quantum dot systems as random geometric graphs with probability amplitude-based weighted links. Nanomaterials, 11.