New upper bounds for graph energy
From MaRDI portal
Cites work
- A note on the general zeroth–order Randic coindex of graphs
- A unified approach to the extremal trees for different indices
- Analytic Inequalities
- Energy of a graph
- Generalizations of Szőkefalvi Nagy and Chebyshev inequalities with applications in spectral graph theory
- Graph energy
- scientific article; zbMATH DE number 5005350 (Why is no real title available?)
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- scientific article; zbMATH DE number 1556756 (Why is no real title available?)
- scientific article; zbMATH DE number 233956 (Why is no real title available?)
- scientific article; zbMATH DE number 6282177 (Why is no real title available?)
- Maximal energy bipartite graphs
- Maximal energy graphs
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- On the spectral radius of graphs
- On the spectral radius, k-degree and the upper bound of energy in a graph
- Relations between degrees, conjugate degrees and graph energies
- Sharp bounds on the spectral radius and the energy of graphs
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Some upper bounds for the energy of graphs
- Spectra of graphs. Theory and application
- The \(a\) and \((a, b)\)-analogs of Zagreb indices and coindices of graphs
- The Largest Vertex Degree Sum for a Triangle in a Graph
This page was built for publication: New upper bounds for graph energy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995098)
