Some upper bounds for the energy of graphs

DOI10.1007/s10910-006-9183-9zbMath1110.92070OpenAlexW1979605676MaRDI QIDQ882594

Feng Tian, Mei Lu, Huiqing Liu

Publication date: 24 May 2007

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-006-9183-9

zbMATH Keywords

energytreegraphbipartite forest

Mathematics Subject Classification ID

Applications of graph theory (05C90) Chemistry (92E99) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (18)

On solutions of fractional order telegraph partial differential equation by Crank-Nicholson finite difference method ⋮ On the spectral radius and energy of digraphs ⋮ Bounds for the (Laplacian) spectral radius of graphs with parameter α ⋮ Minimum energy on trees with \(k\) pendent vertices ⋮ A sharp lower bound of the spectral radius with application to the energy of a graph ⋮ On the Energy of Graphs ⋮ A decreasing sequence of upper bounds for the Laplacian energy of a tree ⋮ A majorization method for localizing graph topological indices ⋮ MINIMUM COVERING SEIDEL ENERGY OF A GRAPH ⋮ New Bounds for Distance Energy of A Graph ⋮ Unnamed Item ⋮ COMPUTATION OF VERTEX DEGREE ENERGY OF A GRAPH ⋮ On the energy of \((0, 1)\)-matrices ⋮ Energy of nonsingular graphs: improving lower bounds ⋮ A note on the minimum edge dominating energy of graphs ⋮ Improved McClelland and Koolen-Moulton bounds for distance energy of a graph ⋮ Unnamed Item ⋮ Energy and basic reproduction number of n-Corona graphs prior to order 1

Cites Work

• Bounds on eigenvalues and chromatic numbers
• Maximal energy bipartite graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Maximal energy graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some upper bounds for the energy of graphs