DC FieldValueLanguage
dc.contributor.authorVasilyev, Alexanderen
dc.contributor.authorDarda, Ratkoen
dc.contributor.authorStevanović, Draganen
dc.date.accessioned2020-05-01T20:13:00Z-
dc.date.available2020-05-01T20:13:00Z-
dc.date.issued2014-01-01en
dc.identifier.issn0340-6253en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1249-
dc.description.abstractWe characterize extremal trees with minimal first Zagreb index among trees of order n and the independence number á, solving one of open problems of Das, Xu and Gutman from [MATCH Commun. Math. Comput. Chem. 70 (2013), 301-314].en
dc.publisherFaculty of Sciences, University of Kragujevac-
dc.relationSlovenian Research Agency, Projects J1-4021 and P1-0285-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofMatchen
dc.titleTrees of given order and independence number with minimal first Zagreb indexen
dc.typeArticleen
dc.identifier.scopus2-s2.0-84908426642en
dc.relation.firstpage775en
dc.relation.lastpage782en
dc.relation.issue3en
dc.relation.volume72en
dc.description.rankM21-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
item.fulltextNo Fulltext-
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-
crisitem.author.orcid0000-0003-2908-305X-
Show simple item record

SCOPUSTM   
Citations

38
checked on Jun 2, 2024

Page view(s)

24
checked on May 9, 2024

Google ScholarTM

Check


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