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 of order at least 2 and , the Steiner distance of the set of vertices in is the minimum size of a connected subgraph whose vertex set contains or connects . In this paper, we introduce the concept of the Steiner (revised) Szeged index () of a graph , which is a natural generalization of the well-known (revised) Szeged index of chemical use. We determine the 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 () of a connected graph , and establish some of its properties. Formulas of () for small and large are also given in this paper.
Recommendations
Cited in
(11)- On the average Steiner 3-eccentricity of trees
- The Steiner \(k\)-eccentricity on trees
- The \(k\)-Szeged index of graphs
- Results on two kinds of Steiner distance-based indices for some classes of graphs
- On the Steiner (revised) Szeged index
- On Mostar index of trees with parameters
- Steiner distance in chemical graph theory
- Steiner Harary index
- Steiner Gutman index
- Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
- The average Steiner 3-eccentricity of block graphs
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)