izvor podataka: crosbi
!
Triregular Graphs Whose Energy Exceeds the Number of Vertices (CROSBI ID 148523)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Majstorović, Snježana ; Klobučar, Antoaneta ; Gutman, Ivan
Triregular Graphs Whose Energy Exceeds the Number of Vertices // MATCH : communications in mathematical and in computer chemistry, 62 (2009), 3; 509-524
Podaci o odgovornosti
Majstorović, Snježana ; Klobučar, Antoaneta ; Gutman, Ivan
engleski
Triregular Graphs Whose Energy Exceeds the Number of Vertices
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.
Triregular Graph; Energy of Graph
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
62 (3)
2009.
509-524
objavljeno
0340-6253