DC FieldValueLanguage
dc.contributor.authorFeng, Lihuaen
dc.contributor.authorLu, Luen
dc.contributor.authorRéti, Tamásen
dc.contributor.authorStevanović, Draganen
dc.date.accessioned2020-05-01T20:12:56Z-
dc.date.available2020-05-01T20:12:56Z-
dc.date.issued2020-07-15en
dc.identifier.issn0024-3795en
dc.description.abstractThe first and the second Zagreb index of a graph, usually defined as the sum of the squares of degrees over all vertices and the sum of the products of degrees of edge endvertices over all edges, respectively, are tightly related to the numbers of walks of length two and three in the graph. We provide here a lower bound on the spectral radius of adjacency matrix A of graph in terms of its Zagreb indices, based on the properties of the least square approximation of the vector A2j with the vectors Aj and j, where j is the all-one vector. The bound is sharp for all graphs with two main eigenvalues, surpassing the range of sharpness of other bounds among connected graphs.en
dc.publisherElsevier-
dc.relationNSFC (Nos. 11671402, 11871479)-
dc.relationHunan Provincial Natural Science Foundation (Nos. 2016JJ2138, 2018JJ2479)-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectMain eigenvalues | Number of walks | Rayleigh quotient | Zagreb indicesen
dc.titleA bound on the spectral radius of graphs in terms of their Zagreb indicesen
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2020.03.021en
dc.identifier.scopus2-s2.0-85082003720en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage33en
dc.relation.lastpage45en
dc.relation.volume597en
dc.description.rankM21-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-2908-305X-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
Show simple item record

SCOPUSTM   
Citations

3
checked on Nov 27, 2022

Page view(s)

29
checked on Nov 27, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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