Upper bounds on the energy of graphs in terms of matching number
From MaRDI portal
Publication:3390797
DOI10.2298/AADM201227016AzbMATH Open1499.05348MaRDI QIDQ3390797FDOQ3390797
Authors: S. Akbari, Milica Andelić, Abdullah Al-Azemi
Publication date: 25 March 2022
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- 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 odd cycles of graphs
- Lower bounds of graph energy in terms of matching number
- Improved lower bound on the energy of line graphs
- Energy, matching number and rank of graphs
- Upper bounds of graph energy in terms of matching number
- Energy of strong double graphs
- Title not available (Why is that?)
- Remarks on the bounds of graph energy in terms of vertex cover number or matching number.
- Upper bounds of the energy of triangle-free graphs in terms of matching number
- On graph energy, maximum degree and vertex cover number on graph energy, maximum degree and vertex cover number
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)