Sombor index of trees with at most three branch vertices
Roberto Cruz,
Juan Rada and
José M. Sigarreta
Applied Mathematics and Computation, 2021, vol. 409, issue C
Abstract:
Let G be a graph with set of vertices V(G) and set of edges E(G). The Sombor index is a vertex-degree-based-topological index recently introduced by Ivan Gutman, defined asSO(G)=∑uv∈E(G)(du)2+(dv)2.In this paper we determine the extremal values of SO over trees with at most three branch vertices.
Keywords: Sombor index; Extremal values; Trees; Branch vertices (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321005038
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:409:y:2021:i:c:s0096300321005038
DOI: 10.1016/j.amc.2021.126414
Access Statistics for this article
Applied Mathematics and Computation is currently edited by Theodore Simos
More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu (repec@elsevier.com).