|
This article is cited in 1 scientific paper (total in 1 paper)
Discrete mathematics and mathematical cybernetics
Wiener index of subdivisions of a tree
A. A. Dobrynin Sobolev Institute of Mathematics, 4, Koptyuga ave., Novosibirsk, 630090, Russia
Abstract:
The Wiener index $W(T)$ of a tree $T$ is defined as the sum of
distances between all vertices of $T$.
The edge $k$-subdivision $T_e$ is constructed from a tree $T$ by replacing
its edge $e$ with the path on $k+2$ vertices.
Edge $k$-subdivisions of each of edges $e_1, e_2, \dots, e_{n-1}$ of a tree
with $n$ vertices generate a family containing $n-1$ trees.
A relation between quantities $W(T_{e_1}) + W(T_{e_2}) + \cdots + W(T_{e_{n-1}})$
and $W(T)$ is established.
Keywords:
tree, graph invariant, Wiener index.
Received July 26, 2019, published November 5, 2019
Citation:
A. A. Dobrynin, “Wiener index of subdivisions of a tree”, Sib. Èlektron. Mat. Izv., 16 (2019), 1581–1586
Linking options:
https://www.mathnet.ru/eng/semr1151 https://www.mathnet.ru/eng/semr/v16/p1581
|
Statistics & downloads: |
Abstract page: | 239 | Full-text PDF : | 133 | References: | 25 |
|