Bounding the sum of powers of the Laplacian eigenvalues of graphs

DOI10.1007/s11766-011-2732-4zbMath1240.05186OpenAlexW1964560831MaRDI QIDQ655758

Xiaodan Chen, Jian Guo Qian

Publication date: 27 January 2012

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-011-2732-4

zbMATH Keywords

connectivitychromatic numberLaplacian eigenvaluesKirchhoff indexthe first Zagreb index

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (5)

Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs ⋮ Laplacian spectral moment and Laplacian Estrada index of random graphs ⋮ Sum of powers of the Laplacian eigenvalues and the Kirchhoff index of a graph ⋮ Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs ⋮ Inequalities for real number sequences with applications in spectral graph theory

Cites Work

• A note on sum of powers of the Laplacian eigenvalues of bipartite graphs
• An upper bound on the sum of squares of degrees in a graph
• On the Laplacian energy of a graph
• On sum of powers of Laplacian eigenvalues and Laplacian Estrada index of graphs
• On the sum of powers of Laplacian eigenvalues of bipartite graphs
• On sum of powers of the Laplacian eigenvalues of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounding the sum of powers of the Laplacian eigenvalues of graphs