The energy of C₄-free graphs of bounded degree

DOI10.1016/J.LAA.2007.12.005zbMATH Open1170.05326arXiv0711.3497OpenAlexW2063323553MaRDI QIDQ924329FDOQ924329

Authors: Vladimir Nikiforov 

Publication date: 15 May 2008

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

Abstract: Answering some questions of Gutman, we show that, except for four specific trees, every connected graph G of order n, with no cycle of order 4 and with maximum degree at most 3, has energy greater that its order. Here, the energy of a graph is the sum of the moduli of its eigenvalues. We give more general theorems and state two conjectures.

Full work available at URL: https://arxiv.org/abs/0711.3497

Recommendations

• Publication:4493219
• The fourth maximal energy of acyclic graphs
• The maximum spectral radius of \(C_4\)-free graphs of given order and size
• scientific article; zbMATH DE number 23200
• On a conjecture about the hypoenergetic trees

zbMATH Keywords

maximum degreegraph energygraph eigenvalues\(C_{4}\)-free graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper and lower bounds for the energy of bipartite graphs.
• Hypoenergetic trees
• On graphs whose energy exceeds the number of vertices

Cited In (7)

• Loose vertices in \(C_{4}\)-free Berge graphs
• Relations between energy and Sombor index
• All hypoenergetic graphs with maximum degree at most 3
• 3-regular digraphs with optimum skew energy
• Energy of line graphs
• Title not available (Why is that?)
• Large P₄‐free graphs with bounded degree

This page was built for publication: The energy of \(C_4\)-free graphs of bounded degree

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