On the minimal energy of tetracyclic graphs

preprint2014arXivOpen access

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 nn with minimal energy. By this, the validity of a conjecture for the case e=n+3e=n+3 proposed by Caporossi et al. \cite{CCGH} has been confirmed.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.