All hypoenergetic graphs with maximum degree at most 3

DOI10.1016/J.LAA.2009.07.007zbMATH Open1200.05131OpenAlexW1972528576MaRDI QIDQ734925

Xueliang Li, Hongping Ma

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

energy of a graphcyclomatic numberhypoenergeticquadrangle-containing (-free)

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hypoenergetic and strongly hypoenergetic trees
• Graph energy change due to edge deletion
• Graphs and matrices with maximal energy
• On graphs whose energy exceeds the number of vertices
• The energy of \(C_4\)-free graphs of bounded degree

Cited In (3)

• More on borderenergetic graphs
• On complete multipartite orderenergetic graphs
• On the Energy of Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734925)