
تعداد نشریات | 5 |
تعداد شمارهها | 116 |
تعداد مقالات | 1,363 |
تعداد مشاهده مقاله | 1,365,523 |
تعداد دریافت فایل اصل مقاله | 1,323,161 |
Extended Sombor indices | ||
Communications in Combinatorics and Optimization | ||
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 26 تیر 1404 | ||
نوع مقاله: Original paper | ||
شناسه دیجیتال (DOI): 10.22049/cco.2025.29344.1951 | ||
نویسندگان | ||
Sultan Ahmad؛ Rashid Farooq* | ||
Department of Mathematics, School of Natural Sciences, National University of Sciences and Technology, H-12, Islamabad 44000, Pakistan | ||
چکیده | ||
In this paper, we present a novel perspective on vertex-degree-based topological indices. Established degree--based topological indices are based on adjacent vertices. One could contemplate including all pairs of vertices. Recently, Gutman introduced the Sombor indices. Here, we introduce the extended versions of the Sombor indices including all pairs of vertices in the Sombor indices formula. We explore the fundamental mathematical properties of these extended indices, establish upper and lower bounds in terms of some graph parameters, and find the sharp bounds. Additionally, we determine the extremal chemical trees with maximum and minimum extended Sombor index. Moreover, the role of extended Sombor indices in describing structure–property relationships is demonstrated. | ||
کلیدواژهها | ||
Sombor indices؛ extended Sombor indices؛ chemical trees | ||
آمار تعداد مشاهده مقاله: 5 |