Steiner Wiener index of graph products
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 the minimum size of a connected subgraph of G whose vertex set is S. The k-...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2016-09-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/article_13499_e8db28e08ac92c0269c208de9cd50572.pdf |