Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Yaoping Mao"'
Publikováno v:
Transactions on Combinatorics, Vol 5, Iss 3, Pp 39-50 (2016)
The Wiener index W(G) of a connected graph G is defined as W(G)=∑u,v∈V(G)dG(u,v) where dG(u,v) is the distance between the vertices u and v of G. For S⊆V(G), the Steiner distance d(S) of the vertices of S is
Externí odkaz:
https://doaj.org/article/f70e8f8680904671b9e6402a0344ec52
