On the distance spectral radius and the distance energy of graphs

Basit Öğe Kaydı
dc.contributor.authorGungor, A. Dilek
dc.contributor.authorBozkurt, S. Burca
dc.date.accessioned2020-03-26T18:15:30Z
dc.date.available2020-03-26T18:15:30Z
dc.date.issued2011
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThe D-eigenvalues {mu(1), mu(2), ... , mu(p)} of a connected graph G are the eigenvalues of its distance matrix D. The D-energy of a graph G is the sum of the absolute values of its D-eigenvalues denoted by E(D)(G). In this article, we obtain a lower bound for the largest D-eigenvalue of G and an upper bound for E(D)(G) which improve Indulal's bounds [G. Indulal, Sharp bounds on the distance spectral radius and the distance energy of graphs, Linear Algebra Appl. 430 (2009), pp. 106-113]. In the final section of the article, we give an important remark on the distance regular graphs.en_US
dc.identifier.doi10.1080/03081080903503678en_US
dc.identifier.endpage370en_US
dc.identifier.issn0308-1087en_US
dc.identifier.issue4en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage365en_US
dc.identifier.urihttps://dx.doi.org/10.1080/03081080903503678
dc.identifier.urihttps://hdl.handle.net/20.500.12395/26693
dc.identifier.volume59en_US
dc.identifier.wosWOS:000289775100002en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherTAYLOR & FRANCIS LTDen_US
dc.relation.ispartofLINEAR & MULTILINEAR ALGEBRAen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectdistance spectral radiusen_US
dc.subjectdistance energyen_US
dc.titleOn the distance spectral radius and the distance energy of graphsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu