The minimum Sombor index of trees with given number of pendant vertices
For any graph G, the Sombor index is defined as SO (G)=∑ uv∈ E (G) d G 2 (u)+ d G 2 (v),
where d G (u) is the degree of the vertex u in G. In this paper, we determine the minimum …
where d G (u) is the degree of the vertex u in G. In this paper, we determine the minimum …
[PDF][PDF] On optimal molecular trees with respect to Sombor indices
A Ali, S Noureen, AA Bhatti, AM Albalahi - AIMS Mathematics, 2023 - aimspress.com
On optimal molecular trees with respect to Sombor indices Page 1 http://www.aimspress.com/journal/Math
AIMS Mathematics, 8(3): 5369–5390. DOI: 10.3934/math.2023270 Received: 27 September …
AIMS Mathematics, 8(3): 5369–5390. DOI: 10.3934/math.2023270 Received: 27 September …
Another Approach to a Conjecture about the Exponential Reduced Sombor Index of Molecular Trees
A Ghalavand, M Tavakoli - Iranian Journal of Mathematical …, 2022 - ijmc.kashanu.ac.ir
For a graph G, the exponential reduced Sombor index (ERSI), denoted by eSored, is∑ uv∈
E (G) e√(dG (v)-1)^ 2+(dG (u)-1)^ 2), where dG (v) is the degree of vertex v. The authors in …
E (G) e√(dG (v)-1)^ 2+(dG (u)-1)^ 2), where dG (v) is the degree of vertex v. The authors in …