All hypoenergetic graphs with maximum degree at most 3

DOI10.1016/J.LAA.2009.07.007zbMath1200.05131OpenAlexW1972528576MaRDI QIDQ734925

Hongping Ma, Xue Liang Li

Publication date: 14 October 2009

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

Full work available at URL: https://doi.org/10.1016/j.laa.2009.07.007

zbMATH Keywords

cyclomatic numberenergy of a graphhypoenergeticquadrangle-containing (-free)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

On the Energy of Graphs ⋮ More on borderenergetic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs and matrices with maximal energy
• The energy of \(C_4\)-free graphs of bounded degree
• On graphs whose energy exceeds the number of vertices
• Graph energy change due to edge deletion
• Hypoenergetic and strongly hypoenergetic trees

This page was built for publication: All hypoenergetic graphs with maximum degree at most 3