Bounds of graph energy in terms of vertex cover number

DOI10.1016/J.LAA.2016.12.015MaRDI QIDQ503428zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

matching numbergraph energyvertex cover number

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 5005350 (Why is no real title available?)
• scientific article; zbMATH DE number 6750317 (Why is no real title available?)
• A lower bound for the energy of symmetric matrices and graphs
• An improved upper bound of the energy of some graphs and matrices
• Energy of a graph
• Graph energy
• Graph energy change due to edge deletion
• Lower bounds for energy of quadrangle-free graphs
• Lower bounds for the energy of (bipartite) graphs
• Lower bounds for the energy of digraphs
• Maximal energy graphs
• On graphs whose energy exceeds the number of vertices
• On the nullity of graphs
• On the spectral radius, \(k\)-degree and the upper bound of energy in a graph
• Some new lower bounds for energy of graphs
• Some relations between rank, chromatic number and energy of graphs
• Upper and lower bounds for the energy of bipartite graphs.

Cited in

(13)

• Bounds for graph energy in terms of vertex covering and clique numbers
• Some Relations Between Rank, Vertex Cover Number and Energy of Graph
• On the energy and spread of the adjacency, Laplacian and signless Laplacian matrices of graphs
• Bounds for the energy of a complex unit gain graph
• 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
• 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 the \(\alpha\)-adjacency energy of a graph
• On Sombor index and graph energy
• Bounds for the energy of weighted graphs
• Lower bounds on the vertex cover number and energy of graphs
• Independence number in graphs and its upper bounds

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)