Ordering the non-starlike trees with large reverse Wiener indices

Title:

Ordering the non-starlike trees with large reverse Wiener indices

Creator:

Li, Shuxian and Zhou, Bo

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:3b820a53-bf96-4a39-aabf-3cb531712735
uuid:3b820a53-bf96-4a39-aabf-3cb531712735

Subject:

distance, diameter, Wiener index, reverse Wiener index, trees, starlike trees;, and caterpillars

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

The reverse Wiener index of a connected graph $G$ is defined as \[ \Lambda (G)=\frac {1}{2}n(n-1)d-W(G), \] where $n$ is the number of vertices, $d$ is the diameter, and $W(G)$ is the Wiener index (the sum of distances between all unordered pairs of vertices) of $G$. We determine the $n$-vertex non-starlike trees with the first four largest reverse Wiener indices for $n\ge 8$, and the $n$-vertex non-starlike non-caterpillar trees with the first four largest reverse Wiener indices for $n\ge 10$.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

215-233

Source:

Czechoslovak Mathematical Journal | 2012 Volume:62 | Number:1

Harvested from:

CDK

Metadata only:

false