Naslov
Triregular Graphs Whose Energy Exceeds the Number of Vertices

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

Izvornik
MATCH (0340-6253) 62 (2009), 3; 509-524

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

Ključne riječi
Triregular Graph; Energy of Graph

Sažetak
A graph is said to be triregular if its vertex degrees assume exactly three different values. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G. Conditions are established under which the inequality E(G)>n is obeyed for connected n-vertex acyclic, uniciclic and biciclic triregular graphs.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA