On the Steiner (Revised) Szeged Index
On the Steiner (Revised) Szeged Index
复制标题
DOI：
--
复制
发表时间：
2020
影响因子：
2.6
通讯作者：
Das Kinkar Chandra
中科院分区：
文献类型：
--
作者：
Liu Mengmeng;Das Kinkar Chandra
The kth Steiner (revised) Szeged index is defined from Steiner distance, in order to generalize the (revised) Szeged index. In this paper, we obtain some upper and lower bounds on the kth Steiner (revised) Szeged index of graphs. Then we give Nordhaus-Gaddum-type results of the kth Steiner (revised) Szeged index of graphs. Moreover, we determine a formula on rSz(k) (G) for trees in general, and present a lower bound on the third Steiner Szeged index for trees of order n and characterize the graphs which attained the bound. Finally, we prove that the path P-n gives the maximum value of the third Steiner Szeged index among the star-like trees of order n >= 10.
