A lower bound for graph energy

DOI10.1080/03081087.2018.1552242zbMath1448.05093OpenAlexW2902053994WikidataQ114641327 ScholiaQ114641327MaRDI QIDQ5122484

Dongqin Sun, Dein Wong, Qi Zhou

Publication date: 23 September 2020

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2018.1552242

zbMATH Keywords

rankmatching numbergraph energy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Relation between the trace norm of an oriented graph and its rank ⋮ Some results on spectrum and energy of graphs with loops ⋮ New bounds on the energy of a graph ⋮ Upper bounds on the energy of graphs in terms of matching number

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of graphs with rank 5
• A characterization of graphs with rank 4
• On the nullity and the matching number of unicyclic graphs
• On the nullity of bicyclic graphs
• On the nullity of graphs with pendent vertices
• On graphs whose energy exceeds the number of vertices
• Lower bounds of graph energy in terms of matching number
• Graph energy change due to edge deletion
• Graph Energy
• On the nullity of graphs
• On the nullity of bipartite graphs

This page was built for publication: A lower bound for graph energy