Steiner (revised) Szeged index of graphs

From MaRDI portal
Publication:5159211




Abstract: The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph G of order at least 2 and SsubseteqV(G), the Steiner distance dG(S) of the set S of vertices in G is the minimum size of a connected subgraph whose vertex set contains or connects S. In this paper, we introduce the concept of the Steiner (revised) Szeged index (rSzk(G)) Szk(G) of a graph G, which is a natural generalization of the well-known (revised) Szeged index of chemical use. We determine the Szk(G) for trees in general. Then we give a formula for computing the Steiner Szeged index of a graph in terms of orbits of automorphism group action on the edge set of the graph. Finally, we give sharp upper and lower bounds of (rSzk(G)) Szk(G) of a connected graph G, and establish some of its properties. Formulas of (rSzk(G)) Szk(G) for small and large k are also given in this paper.









This page was built for publication: Steiner (revised) Szeged index of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159211)