DC FieldValueLanguage
dc.contributor.authorSimić, Slobodanen
dc.contributor.authorTošić, Dejanen
dc.date.accessioned2020-05-01T20:12:51Z-
dc.date.available2020-05-01T20:12:51Z-
dc.date.issued2005-01-01en
dc.identifier.issn0340-6253en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1176-
dc.description.abstractLet Τ(n, Δ) be the set of all trees on n vertices with a given maximum degree Δ. In this paper we identify in Τ(n, Δ) the tree whose index, i.e. the largest eigenvalue of the adjacency matrix, has the maximum value.en
dc.publisherFaculty of Science, University of Kragujevac-
dc.relation.ispartofmatch : Communications in Mathematical and in Computer Chemistryen
dc.titleThe index of trees with specified maximum degreeen
dc.typeArticleen
dc.identifier.scopus2-s2.0-29344459456en
dc.relation.firstpage351en
dc.relation.lastpage362en
dc.relation.issue2en
dc.relation.volume54en
dc.description.rankM22-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
Show simple item record

SCOPUSTM   
Citations

18
checked on Jul 22, 2024

Page view(s)

39
checked on May 9, 2024

Google ScholarTM

Check


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