# Search results for: Xueliang Li

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 83-95

Discussiones Mathematicae Graph Theory > 2016 > 36 > 2 > 455-465

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 83-95

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 al. in 1989, is the minimum size of a connected subgraph of G whose vertex set contains S. The k-th...

Discussiones Mathematicae Graph Theory > 2016 > 36 > 2 > 455-465

The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) = ∑u,v∈V(G) d(u, v) where dG(u, v) is the distance between vertices u and v of G. 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 S ⊆ V (G), the Steiner distance...