On a conjecture about tricyclic graphs with maximal energy

Abstract

For a given simple graph G, the energy of G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix, which was defined by I. Gutman. The problem on determining the maximal energy tends to be complicated for a given class of graphs. There are many approaches on the maximal energy of trees, unicyclic graphs and bicyclic graphs, respectively. Let P 6,6,6 n * Supported by NSFC.