Szeged and Mostar root-indices of graphs

被引：10

作者：

Brezovnik, Simon ^{[1
]}

Dehmer, Matthias ^{[2
,3
,4
,5
]}

Tratnik, Niko ^{[6
,7
]}

Pletersek, Petra Zigert ^{[6
,8
]}

机构：

[1] Univ Ljubljana, Fac Mech Engn, Ljubljana, Slovenia

[2] UMIT Private Univ Hlth Sci, Eduard Wallnofer Zent 1, Dept Biomed Comp Sci & Mechatron, Hall Tyrol, A-6060 Tyrol, Austria

[3] Swiss Distance Univ Appl Sci, Brig, Switzerland

[4] Nankai Univ, Coll Artificial Intelligence, Tianjin, Peoples R China

[5] Xian Technol Univ, Sch Sci, Xian 710021, Shaanxi, Peoples R China

[6] Univ Maribor, Fac Nat Sci & Math, Maribor, Slovenia

[7] Inst Math Phys & Mech, Ljubljana, Slovenia

[8] Univ Maribor, Fac Chem & Chem Engn, Maribor, Slovenia

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2023年 / 442卷

关键词：

Szeged index; Szeged polynomial; Mostar polynomial; Root-index; Discrimination power; Sensitivity;

D O I：

10.1016/j.amc.2022.127736

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Various distance-based root-indices of graphs are introduced and studied in the present article. They are obtained as unique positive roots of modified graph polynomials. In particular, we consider the Szeged polynomial, the weighted-product Szeged polynomial, the weighted-plus Szeged polynomial, and the Mostar polynomial. We derive closed formulas of these polynomials for some basic families of graphs. Consequently, we provide closed formulas for some root-indices and examine the convergence of sequences of certain root-indices. Moreover, some general properties of studied root-indices are stated. Finally, numerical results related to discrimination power, correlations, structure sensitivity, and abruptness of root-indices are calculated, interpreted, and compared to already known similar descriptors. (c) 2022 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

引用

页数：11

共 22 条

[1] Mostar index: Results and perspectives [J].