Szeged and Mostar root-indices of graphsBrezovnik, Simon (Avtor) Dehmer, Matthias (Avtor) Tratnik, Niko (Avtor) Žigert Pleteršek, Petra (Avtor) Szeged indexSzeged polynomialMostar polynomialroot-indexdiscrimination powersensitivityVarious 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.20232025-04-18 11:54:28Članek v reviji168616UDK: 519.17ISSN pri članku: 0096-3003DOI: 10.1016/j.amc.2022.127736COBISS_ID: 139442179sl