engleski

Tricyclic Biregular Graphs whose Energy Exceeds the Number of Vertices

The eigenvalues of a graph are eigenvalues of its adjacent matrix. The energy E(G) of a 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 nad b. A connected graph with n vertices and m edges is tricyclic if m = n+2. The inequality E(G)>n is studied for connected tricyclic biregular graphs, and conditions for its validity are established.

energy (of graph); biregular graph; tricyclic graph

nije evidentirano