Ordering trees with given matching number by their Wiener indices

Autor: Ning-ning Wei, Qi-long Wang, Dong-fang Wang, Shang-wang Tan
Rok vydání: 2014
Předmět:
Zdroj: Journal of Applied Mathematics and Computing. 49:309-327
ISSN: 1865-2085
1598-5865
DOI: 10.1007/s12190-014-0840-z
Popis: The Wiener index of a connected graph is the sum of distances between all pairs of vertices in the graph. Let $$\Gamma (n,i)$$ be the set of all trees with order $$n$$ and matching number $$i$$ . In this article, we give five graphic transformations that change the Wiener index of graphs, then with them we determine the second to sixth trees in $$\Gamma (2i+1,i)$$ and the third to eighth trees in $$\Gamma (n,i)$$ for $$n\ge 2i+2$$ having the smallest Wiener indices.
Databáze: OpenAIRE
Externí odkaz: