Article
Keywords:
tree; molecular tree; Sombor-index-like graph invariant; extremal value
Summary:
I. Gutman (2022) constructed six new graph invariants based on geometric parameters, and named them Sombor-index-like graph invariants, denoted by $\mathcal {SO}_1, \mathcal {SO}_2, \dots , \mathcal {SO}_6$. Z. Tang, H. Deng (2022) and Z. Tang, Q. Li, H. Deng (2023) investigated the chemical applicability and extremal values of these Sombor-index-like graph invariants, and raised some open problems, see Z. Tang, Q. Li, H. Deng (2023). We consider the first open problem formulated at the end of Z. Tang, Q. Li, H. Deng (2023). We obtain the extremal values of the graph invariants $\mathcal {SO}_5$ and $\mathcal {SO}_6$ among all trees and molecular trees of order $n$, and characterize the trees and molecular trees that achieve the extremal values, respectively. Thus, the problem is completely solved.
References:
[1] Gutman, I.:
Geometric approach to degree-based topological indices: Sombor indices. MATCH Commun. Math. Comput. Chem. 86 (2021), 11-16.
MR 4773882 |
Zbl 1474.92154
[3] Gutman, I., Miljković, O.:
Molecules with smallest connectivity indices. MATCH Commun. Math. Comput. Chem. 41 (2000), 57-70.
MR 1787632 |
Zbl 1036.92043