Answers are grounded in this paper and cite their sources.
Study proves critical inequalities in Laplacian and Quasi-Laplacian energy for trees, highlighting graph properties.
For a simple graph G, the Laplacian matrix is denoted by $L(G)$ and the Signless Laplacian matrix is denoted by $Q(G)$. These matrices and their eigenvalues are widely used in many fields such as network measurement and chemical structures. Laplacian energy of a graph G of order n is defined as LE(G)= ∑ᵢ₌₁ⁿ \ |μᵢ- d |, where μᵢ is the i-th eigenvalue of Laplacian matrix of G, and d is average degree. Similarly, the Quasi-Laplacian energy of the graph G of order n is defined as EQ(G)= ∑ᵢ₌₁ⁿ \ σᵢ², where σᵢ is the i-th eigenvalue of Signless Laplacian matrix of G.The inequality LE(Pₙ) ≤ LE(Tₙ) ≤ LE(Sₙ) was given as conjecture by Radenković and Gutman in 2007. This conjucture was proved by Trevisan et al. for trees with 3 diameters and by Rehman et al. for trees with 4 diameters. Our aim is to prove this conjecture for trees with larger diameters. In this study, we solved the above conjecture for some tree classes between 5 and 15 in diameter by the linear time algorithm for characteristic polynomials. It is also proved EQ( Pₙ ) ≤ EQ( Tₙ ) ≤ EQ( Sₙ ) inequality, which is similar to Gutman's conjecture for the Quasi-Laplacian energy.
No takes yet. Share an insight, caveat, or question.
Erdem et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: