Note for Nikiforov's two conjectures on the energy of trees

Abstract

The energy E of a graph is defined to be the sum of the absolute values of its eigenvalues. Nikiforov in ``V. Nikiforov, The energy of C4-free graphs of bounded degree, Lin. Algebra Appl. 428(2008), 2569--2573" proposed two conjectures concerning the energy of trees with maximum degree ≤ 3. In this short note, we show that both conjectures are true.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…