Lower Bounds for the Energy of (Bipartite) Graphs

Basit Öğe Kaydı
dc.contributor.authorAltındağ, Ş. Burcu Bozkurt
dc.contributor.authorBozkurt, Durmuş
dc.date.accessioned2020-03-26T19:42:01Z
dc.date.available2020-03-26T19:42:01Z
dc.date.issued2017
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThe energy of a graph is defined as the sum of absolute values of its eigenvalues. In this paper, we establish some lower bounds for the energy of (bipartite) graphs involving the number of vertices (n), the number edges (m) and the determinant of the adjacency matrix (det A). Our lower bound for graphs improves the lower bound in [2] for a class of graphs.en_US
dc.description.sponsorshipTUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK); Office of Selguk University Research Project (BAP)en_US
dc.description.sponsorshipThe authors are thankful to Prof. Dr. Ivan Gutman for his comments on the references [15] and [16]. The authors are partially supported by TUBITAK and the Office of Selguk University Research Project (BAP).en_US
dc.identifier.endpage14en_US
dc.identifier.issn0340-6253en_US
dc.identifier.issue1en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage9en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12395/35266
dc.identifier.volume77en_US
dc.identifier.wosWOS:000394727900002en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherUNIV KRAGUJEVAC, FAC SCIENCEen_US
dc.relation.ispartofMATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRYen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.titleLower Bounds for the Energy of (Bipartite) Graphsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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