Upper bounds on the energy of graphs in terms of matching number
From MaRDI portal
Publication:3390797
Recommendations
Cites work
- scientific article; zbMATH DE number 3623599 (Why is no real title available?)
- A lower bound for graph energy
- A short proof for graph energy is at least twice of minimum degree
- Bounds for energy of matrices and energy of graphs
- Edge addition, singular values, and energy of graphs and matrices
- Graph energy
- Graphs of maximal energy with fixed maximal degree
- Koolen-Moulton-type upper bounds on the energy of a graph
- Matching theory
- Maximal energy graphs
- New upper bounds for the energy and spectral radius of graph
- On the tree with diameter 4 and maximal energy
- Some lower bounds for the energy of graphs
- Spectra of graphs
- Upper bounds of graph energy in terms of matching number
- Upper bounds of the energy of triangle-free graphs in terms of matching number
Cited in
(10)- Energy, matching number and rank of graphs
- Upper bounds of graph energy in terms of matching number
- Energy of strong double graphs
- Energy, matching number and odd cycles of graphs
- Improved lower bound on the energy of line graphs
- Upper bounds of the energy of triangle-free graphs in terms of matching number
- Lower bounds of graph energy in terms of matching number
- 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.
- scientific article; zbMATH DE number 7410909 (Why is no real title available?)
This page was built for publication: Upper bounds on the energy of graphs in terms of matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390797)