@article {
author = {Legese, Mesfin},
title = {Steiner Wiener Index of Complete m-Ary Trees},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {12},
number = {2},
pages = {101-109},
year = {2021},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2021.242136.1552},
abstract = {Let $G$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. For a subset $S$ of $V(G)$, the Steiner distance $d(S)$ of $S$ is the minimum size of a connected subgraph whose vertex set contains $S$. For an integer $k$ with $2 \le k \le n - 1$, the $k$-th Steiner Wiener index of a graph $G$ is defined as $SW_k(G) = \sum_{\substack{S\subseteq V(G)\\ |S|=k}}d(S)$. In this paper, we present exact values of the $k$-th Steiner Wiener index of complete $m$-ary trees by using inclusion-excluision principle for various values of $k$.},
keywords = {Wiener index,Steiner distance,Steiner Wiener index,Binary trees,Complete m-ary trees},
url = {https://ijmc.kashanu.ac.ir/article_111507.html},
eprint = {https://ijmc.kashanu.ac.ir/article_111507_19d57fc9583ac0a2a82b02c55d1be619.pdf}
}