Lower bounds for the Laplacian energy of bipartite graphs

DOI10.1016/j.dam.2017.12.030zbMath1382.05045OpenAlexW2786674967MaRDI QIDQ1706138

José Luis Palacios

Publication date: 21 March 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.12.030

zbMATH Keywords

largest eigenvalueLaplacian matrixmajorizationLaplacian energy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (1)

The bounds of the energy and Laplacian energy of chain graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Laplacian energy of a graph
• Applications of a theorem by Ky Fan in the theory of graph energy
• On the spectral radius of graphs
• On Laplacian energy of graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• The Laplacian Spectrum of a Graph II
• Inequalities: theory of majorization and its applications

This page was built for publication: Lower bounds for the Laplacian energy of bipartite graphs