Bounds for graph energy in terms of vertex covering and clique numbers
From MaRDI portal
Publication:5009956
DOI10.5614/ejgta.2019.7.2.9zbMath1467.05125OpenAlexW2981149813MaRDI QIDQ5009956
No author found.
Publication date: 23 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2019.7.2.9
Related Items (5)
Energy of strong double graphs ⋮ On unicyclic graphs with given number of pendent vertices and minimal energy ⋮ On graphs with minimal distance signless Laplacian energy ⋮ Nordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energy ⋮ Energies of Hypergraphs
Cites Work
- On the sum of the Laplacian eigenvalues of a graph and Brouwer's conjecture
- A lower bound for the energy of symmetric matrices and graphs
- Energy, Laplacian energy of double graphs and new families of equienergetic graphs
- On the Laplacian eigenvalues of a graph and Laplacian energy
- Bounds of graph energy in terms of vertex cover number
- The energy of graphs and matrices
- Commutativity and spectra of Hermitian matrices
- Signless Laplacian energy of a graph and energy of a line graph
- Note on an upper bound for sum of the Laplacian eigenvalues of a graph
- Some new lower bounds for energy of graphs
- On the bounds for signless Laplacian energy of a graph
- Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum
- Spectra, Energy and Laplacian Energy of Strong Double Graphs
- Graph Energy
- Upper bounds for the sum of Laplacian eigenvalues of a graph and Brouwer’s conjecture
- Eigenvalues, invariant factors, highest weights, and Schubert calculus
- On energy, Laplacian energy and p-fold graphs
- Reciprocal Complementary Distance Spectra and Reciprocal Complementary Distance Energy of Line Graphs of Regular Graphs
- On some covering graphs of a graph
- On distance signless Laplacian spectrum and energy of graphs
- Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds for graph energy in terms of vertex covering and clique numbers
