A lower bound for the energy of symmetric matrices and graphs
From MaRDI portal
(Redirected from Publication:344907)
Recommendations
Cites work
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- An improved upper bound of the energy of some graphs and matrices
- Beyond graph energy: norms of graphs and matrices
- Exploring symmetries to decompose matrices and graphs preserving the spectrum
- Graph energy
- Interlacing eigenvalues and graphs
- Lower bounds for the energy of (bipartite) graphs
- Lower bounds of Nikiforov's energy over digraphs
- Maximum and minimum energy trees with two and three branched vertices
- On the minimal energy of trees with a given number of vertices of odd degree
- Spectra of graphs
- Spectra of graphs obtained by a generalization of the join graph operation
- The energy of graphs and matrices
Cited in
(10)- scientific article; zbMATH DE number 6704589 (Why is no real title available?)
- Bounds for graph energy in terms of vertex covering and clique numbers
- Energy of inverse graphs of dihedral and symmetric groups
- The block energy of a graph
- On energy of matrices of a weighted graph
- On graph energy, maximum degree and vertex cover number on graph energy, maximum degree and vertex cover number
- Remarks on the bounds of graph energy in terms of vertex cover number or matching number.
- Bounds of graph energy in terms of vertex cover number
- Bounds for the energy of weighted graphs
- Weighted graphs with an application to returned sequence
This page was built for publication: A lower bound for the energy of symmetric matrices and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344907)