On the minimal energy of tetracyclic graphs

Hongping Ma; Yongqiang Bai

On the minimal energy of tetracyclic graphs

Combinatorics 2014-08-07 v1

Authors: Hongping Ma , Yongqiang Bai

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. \cite{CCGH} has been confirmed.

Keywords

graph energy tetracyclic graphs adjacency matrix eigenvalues minimal energy graph theory

Cite

@article{arxiv.1408.1283,
  title  = {On the minimal energy of tetracyclic graphs},
  author = {Hongping Ma and Yongqiang Bai},
  journal= {arXiv preprint arXiv:1408.1283},
  year   = {2014}
}