Note on the Distance Energy of Graphs
Yükleniyor...
Dosyalar
Tarih
2010
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
UNIV KRAGUJEVAC, FAC SCIENCE
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
The distance energy of a graph G is defined as the sum of the absolute values of the eigenvalues of the distance matrix of G. In this note, we obtain an upper bound for the:distance energy of any connected graph G. Specially, we present upper bounds for the distance energy of connected graphs of diameter 2 with given numbers of vertices and edges, and unicyclie graphs with odd girth. Additionally, we give also a lower bound for the distance energy of unicyclic graphs with odd girth.
Açıklama
Anahtar Kelimeler
Kaynak
Match-Communications in Mathematical and in Computer Chemistry
WoS Q Değeri
Q1
Scopus Q Değeri
Q1
Cilt
64
Sayı
1
Künye
Bozkurt, Ş. B., Güngör, A. D., Zhou, B., (2010). Note on the Distance Energy of Graphs. Match-Communications in Mathematical and in Computer Chemistry, 64(1), 129-134.
