On the minimal energy of tetracyclic graphs
Abstract
The energy of a graph is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. In this paper, we characterize the tetracyclic graph of order n with minimal energy. By this, the validity of a conjecture for the case e=n+3 proposed by Caporossi et al. CCGH has been confirmed.
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.