Naslov
Tricyclic Biregular Graphs whose Energy Exceeds the Number of Vertices

Autori
Majstorović, Snježana ; Gutman, Ivan ; Klobučar, Antoaneta

Izvornik
Mathematical communications (1331-0623) 15 (2010), 1; 213-222

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
energy (of graph); biregular graph; tricyclic graph

Sažetak
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.

Izvorni jezik
Engleski

Znanstvena područja
Matematika, Kemija

POVEZANOST RADA