A Note on Extremal Sombor Indices of Trees with a Given Degree Sequence

DC Field	Value	Language
dc.contributor.author	Damnjanović, Ivan	en_US
dc.contributor.author	Milošević, Marko	en_US
dc.contributor.author	Stevanović, Dragan	en_US
dc.date.accessioned	2023-06-05T12:04:38Z	-
dc.date.available	2023-06-05T12:04:38Z	-
dc.date.issued	2023-01-01	-
dc.identifier.issn	0340-6253	-
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/5037	-
dc.description.abstract	We note here that the problem of determining extremal values of Sombor index for trees with a given degree sequence fits within the framework of results by Hua Wang from [Cent. Eur. J. Math. 12 (2014) 1656–1663], implying that the greedy tree has the minimum Sombor index, while an alternating greedy tree has the maximum Sombor index.	en_US
dc.publisher	University of Kragujevac, Faculty of Science	en_US
dc.relation.ispartof	Match	en_US
dc.title	A Note on Extremal Sombor Indices of Trees with a Given Degree Sequence	en_US
dc.type	Article	en_US
dc.identifier.doi	10.46793/match.90-1.197D	-
dc.identifier.scopus	2-s2.0-85150303824	-
dc.contributor.affiliation	Mathematics	en_US
dc.contributor.affiliation	Mathematical Institute of the Serbian Academy of Sciences and Arts	en_US
dc.relation.firstpage	197	-
dc.relation.lastpage	202	-
dc.relation.issue	1	-
dc.relation.volume	90	-
dc.description.rank	~M22	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
crisitem.author.orcid	0000-0003-2908-305X	-

2

checked on Jun 1, 2024

29

checked on May 9, 2024

Check