@Article{JNMA-7-1446,
author = {Sarveshkumar , B.Chaluvaraju , B. and Kumar , M. C. Mahesh},
title = {Some Bounds for the Steiner-Harary Index of a Graph},
journal = {Journal of Nonlinear Modeling and Analysis},
year = {2025},
volume = {7},
number = {4},
pages = {1446--1460},
abstract = {<p style="text-align: justify;">The Steiner distance for the set $S ⊆ V (G)$ would simply be the
number of edges in the minimal subtree connecting them and is denoted as $d_G(S).$ The Steiner-Harary index is $SH_k(G),$ defined as the sum of the reciprocal of the Steiner distance for all subsets with $k$ vertices in $G.$ In this article,
we calculate the exact value of $SH_k(G)$ for specific graphs and establish new
best possible lower and upper bounds and characterization. Furthermore, we
explore the relationship between $SH_k(G)$ and other graph indices based on
Steiner distance.</p>},
issn = {2562-2862},
doi = {https://doi.org/10.12150/jnma.2025.1446},
url = {http://global-sci.org/intro/article_detail/jnma/24245.html}
}