The Steiner Gutman Index of Trees
The concept of Gutman index Gut (G) of a connected graph G was introduced in 1994.The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance.The Steiner Gutman kindex SGut k (G) introduced by Mao et al. in 2018, is defined by SGut k (G) = SV (G),|S|=k vS dG (v) dG (S) , where dG (S) is the Steiner distance of S and dG (v) is the degree of v in G.In this paper, we obtained the relations between Steiner Gutman k-index and Gutman index, Wiener index and Steiner Wiener k-index of trees with k = 3, 4.
Authors
- Zhonghua Li (ORCID: https://orcid.org/0000-0001-9254-8716)
Institutions
- Xinjiang University (CN)
Publication Details
- Journal
- match Communications in Mathematical and in Computer Chemistry
- Published
- 2025-01-01
- DOI
- https://doi.org/10.46793/match95-1.22324
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China