A lower bound for graph energy
From MaRDI portal
Publication:5122484
DOI10.1080/03081087.2018.1552242zbMATH Open1448.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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Energy
- A characterization of graphs with rank 5
- On the nullity of bipartite graphs
- A characterization of graphs with rank 4
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- Graph energy change due to edge deletion
- On the nullity of graphs with pendent vertices
- On graphs whose energy exceeds the number of vertices
- On the nullity of graphs
- Lower bounds of graph energy in terms of matching number
Cited In (7)
- Relation between the trace norm of an oriented graph and its rank
- Title not available (Why is that?)
- Lower bounds of graph energy in terms of matching number
- Title not available (Why is that?)
- Upper bounds on the energy of graphs in terms of matching number
- New bounds on the energy of a graph
- Some results on spectrum and energy of graphs with loops
This page was built for publication: A lower bound for graph energy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5122484)
