Wiener index of binomial trees and Fibonacci trees

2009/10/23 by K. Viswanathan Iyer, Iyer, K. Viswanathan, K. Ravindra Reddy +1
Chemistry · Computer Science · Mathematics · #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Graph theory and applications #Synthesis and Properties of Aromatic Compounds #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.0910.4432

openalex publication_date 2009/10/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We obtain a closed-form expression for the Wiener index of binomial trees. We outline efficient algorithms for computing the Wiener indices of Fibonacci and binary Fibonacci trees.

Related

• The extremal values of the Wiener index of a tree with given degree sequence
• The Wiener and Terminal Wiener indices of trees
• Computing the Wiener index in Sierpinski carpet graphs
• The Maximum Wiener Index of Trees with Given Degree Sequences
• On Topological Indices in Trees: Fibonacci Degree Sequences and Bounds