Bounds of graph energy in terms of vertex cover number
DOI10.1016/J.LAA.2016.12.015zbMATH Open1353.05082OpenAlexW2561511156MaRDI QIDQ503428FDOQ503428
Authors: Xiaobin Ma, Long Wang 
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
Recommendations
- On graph energy, maximum degree and vertex cover number on graph energy, maximum degree and vertex cover number
- Bounds for graph energy in terms of vertex covering and clique numbers
- Lower bounds on the vertex cover number and energy of graphs
- Remarks on the bounds of graph energy in terms of vertex cover number or matching number.
- Some Relations Between Rank, Vertex Cover Number and Energy of Graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Graph energy
- Maximal energy graphs
- Upper and lower bounds for the energy of bipartite graphs.
- On the spectral radius, \(k\)-degree and the upper bound of energy in a graph
- Graph energy change due to edge deletion
- Some relations between rank, chromatic number and energy of graphs
- Title not available (Why is that?)
- A lower bound for the energy of symmetric matrices and graphs
- Lower bounds for the energy of (bipartite) graphs
- An improved upper bound of the energy of some graphs and matrices
- Energy of a graph
- Lower bounds for the energy of digraphs
- Lower bounds for energy of quadrangle-free graphs
- On graphs whose energy exceeds the number of vertices
- On the nullity of graphs
- Some new lower bounds for energy of graphs
- Title not available (Why is that?)
Cited In (13)
- Lower bounds on the vertex cover number and energy of graphs
- Bounds for the \(\alpha\)-adjacency energy of a graph
- Bounds for the energy of weighted graphs
- On Sombor index and graph energy
- Bounds for the energy of a complex unit gain graph
- On the energy and spread of the adjacency, Laplacian and signless Laplacian matrices of graphs
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Bounds for graph energy in terms of vertex covering and clique numbers
- Some Relations Between Rank, Vertex Cover Number and Energy of Graph
- Remarks on the bounds of graph energy in terms of vertex cover number or matching number.
- Independence number in graphs and its upper bounds
- 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: Bounds of graph energy in terms of vertex cover number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503428)
