Extremal values on the Sombor index of trees
match Communications in Mathematical and in Computer Chemistry · 2022
DOI: 10.46793/match.87-1.023c ↗Kurz gefasst
Fachartikel in der Zeitschrift match Communications in Mathematical and in Computer Chemistry, 2022. Verfasst von Hanlin Chen und 2 weiteren Autor:innen. Die Arbeit wurde bisher 57-mal zitiert (Crossref).
Abstract (Originalsprache)
The Sombor index of a graph is defined as where denote the degree of the vertex in . In this article, we determine the extremal values of the Sombor index of trees with some given parameters, including matching number, pendant vertices, diameter, segment number, branching number, etc. The corresponding extremal trees are characterized completely.
Zitieren
APA
Chen, H., Li, W., & Wang, J. (2022). Extremal values on the Sombor index of trees. match Communications in Mathematical and in Computer Chemistry. https://doi.org/10.46793/match.87-1.023c
Vancouver
Chen H, Li W, Wang J. Extremal values on the Sombor index of trees. match Communications in Mathematical and in Computer Chemistry. 2022. doi:10.46793/match.87-1.023c
BibTeX
@article{Chen2022,
author = {Chen, Hanlin and Li, Wenhao and Wang, Jing},
title = {Extremal values on the Sombor index of trees},
journal = {match Communications in Mathematical and in Computer Chemistry},
year = {2022},
doi = {10.46793/match.87-1.023c}
}
EUVIMED