On ordinary and reverse Wiener indices of non-caterpillars

✍ Scribed by Wei Luo; Bo Zhou

• Book ID: 104046608
• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 438 KB
• Volume: 50
• Category: Article
• ISSN: 0895-7177
• DOI: 10.1016/j.mcm.2009.02.010

✦ Synopsis

A tree is known as a caterpillar if the removal of all pendant vertices makes it a path. Otherwise, it is a non-caterpillar. From among all n-vertex non-caterpillars with given diameter d, we find the unique tree formed by attaching the path P 2 and nd -3 pendant vertices to a center of the path on d + 1 vertices with minimum Wiener index, where 4 ≤ d ≤ n -3, and we determine the n-vertex non-caterpillars with the kth greatest reverse Wiener indices for all k up to n-3

8 is an integer or not for even n, and n-3

8 is an integer or not for odd n if n ≥ 27.