Bounds of graph energy in terms of vertex cover number
From MaRDI portal
Publication:503428
DOI10.1016/j.laa.2016.12.015zbMath1353.05082OpenAlexW2561511156MaRDI QIDQ503428
Publication date: 12 January 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.12.015
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)
Related Items (9)
On Sombor Index and Graph Energy ⋮ Unnamed Item ⋮ Some Relations Between Rank, Vertex Cover Number and Energy of Graph ⋮ Bounds for the energy of a complex unit gain graph ⋮ Bounds for the energy of weighted graphs ⋮ Upper bounds of the energy of triangle-free graphs in terms of matching number ⋮ Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph ⋮ Remarks on the bounds of graph energy in terms of vertex cover number or matching number ⋮ Bounds for graph energy in terms of vertex covering and clique numbers
Cites Work
- A lower bound for the energy of symmetric matrices and graphs
- On graphs whose energy exceeds the number of vertices
- Lower bounds for the energy of digraphs
- Some relations between rank, chromatic number and energy of graphs
- Upper and lower bounds for the energy of bipartite graphs.
- Some new lower bounds for energy of graphs
- Graph energy change due to edge deletion
- Graph Energy
- On the nullity of graphs
- Maximal energy graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds of graph energy in terms of vertex cover number