DC FieldValueLanguage
dc.contributor.authorAl-Yakoob, Salemen_US
dc.contributor.authorFilipovski, Slobodanen_US
dc.contributor.authorStevanović, Draganen_US
dc.date.accessioned2021-09-27T08:24:25Z-
dc.date.available2021-09-27T08:24:25Z-
dc.date.issued2021-01-01-
dc.identifier.issn0340-6253-
dc.description.abstractAkbari and Hosseinzadeh [MATCH Commun. Math. Comput. Chem. 83 (2020), 631{633] conjectured that the energy of a non-singular graph G is bounded from below by the sum of the maximum and the minimum vertex degree of G, with equality if and only if G is a complete graph. We discuss this conjecture here and provide a few lower bounds on the energy which prove this conjecture in several special cases.en_US
dc.publisherUniversity of Kragujevac, Faculty of Scienceen_US
dc.relation.ispartofMatchen_US
dc.titleProofs of a few special cases of a conjecture on energy of non-singular graphsien_US
dc.typeArticleen_US
dc.identifier.scopus2-s2.0-85114950328-
dc.contributor.affiliationMathematicsen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage577-
dc.relation.lastpage586-
dc.relation.issue3-
dc.relation.volume86-
dc.description.rank~M22-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
crisitem.author.orcid0000-0003-2908-305X-
Show simple item record

Page view(s)

21
checked on Oct 3, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.