izvor podataka: crosbi
!
Biregular Graphs Whose Energy Exceeds the Number of Vertices (CROSBI ID 148552)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Gutman, Ivan ; Klobučar, Antoaneta ; Majstorović, Snježana ; Adiga, Chandrashekar
Biregular Graphs Whose Energy Exceeds the Number of Vertices // MATCH : communications in mathematical and in computer chemistry, 62 (2009), 3; 499-508
Podaci o odgovornosti
Gutman, Ivan ; Klobučar, Antoaneta ; Majstorović, Snježana ; Adiga, Chandrashekar
engleski
Biregular Graphs Whose Energy Exceeds the Number of Vertices
A graph is said to be biregular if its vertex degrees assume exactly two 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 biregular graphs.
Biregular Graph; Energy of Graph
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
62 (3)
2009.
499-508
objavljeno
0340-6253
