On a Conjecture about Tricyclic Graphs with Maximal Energy

By Xueliang Li, Yongtang Shi, Meiqin Wei, Jing Li. 2013

66 citations recorded by the source corpus.

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 denote the graph with n ≥ 20 vertices

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/ae8bde53f17ab90e93b8f8091a2c86c52ebce672