Tricyclic biregular graphs whose energy exceeds the number of vertices

Abstract

The eigenvalues of a graph are the eigenvalues of its adjacency matrix. The energy E(G) of the graph G is the sum of the absolute values of the eigenvalues of G. A graph is said to be (a, b)-biregular if its vertex degrees assume exactly two different values: a and b. A connected graph with n vertices and m edges is tricyclic if m = n + 2. The inequality E… (More)

Topics

4 Figures and Tables