Pregled bibliografske jedinice broj: 386376
Biregular Graphs Whose Energy Exceeds the Number of Vertices
Biregular Graphs Whose Energy Exceeds the Number of Vertices // MATCH : communications in mathematical and in computer chemistry, 62 (2009), 3; 499-508 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 386376 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Biregular Graphs Whose Energy Exceeds the Number of Vertices
Autori
Gutman, Ivan ; Klobučar, Antoaneta ; Majstorović, Snježana ; Adiga, Chandrashekar
Izvornik
MATCH : communications in mathematical and in computer chemistry (0340-6253) 62
(2009), 3;
499-508
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Biregular Graph; Energy of Graph
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
235-2352818-1042 - Pasivna kontrola mehaničkih modela (Truhar, Ninoslav, MZOS ) ( CroRIS)
Ustanove:
Sveučilište u Osijeku, Odjel za matematiku
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
Uključenost u ostale bibliografske baze podataka::
- MathSciNet
- Zentralblatt fur Mathematik
- VINITI Abstracts Journal
- Chemical Abstract
