Inverse Problem on the Steiner Wiener Index
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) =∑u,v∈V (G)dG(u, v), where dG(u, v) is the distance (the length a shortest path) between the vertices u and v in G. For S ⊆ V (G), the Steiner distance d(S) of the vertices of S, introduced by Chartrand et...
Main Authors: | Li Xueliang, Mao Yaping, Gutman Ivan |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2018-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2000 |
Similar Items
-
The Steiner Wiener Index of A Graph
by: Li Xueliang, et al.
Published: (2016-05-01) -
Steiner Wiener Index of Certain Windmill Graphs.
by: Herish Omer Abdullah
Published: (2023-10-01) -
More on the Minimum Size of Graphs with Given Rainbow Index
by: Zhao Yan
Published: (2020-02-01) -
Wiener index and addressing of some finite graphs
by: Mona Gholamnia Taleshani, et al.
Published: (2023-01-01) -
On minimum revised edge Szeged index of bicyclic graphs
by: Mengmeng Liu, et al.
Published: (2022-09-01)