Wiener index of binomial trees and Fibonacci trees
K.Viswanathan Iyer, K.R.Uday Kumar Reddy
TL;DR
This paper derives a closed-form formula for the Wiener index of binomial trees and presents efficient algorithms for calculating the Wiener indices of Fibonacci and binary Fibonacci trees.
Contribution
It provides the first closed-form expression for the Wiener index of binomial trees and efficient algorithms for Fibonacci-related trees.
Findings
Closed-form Wiener index for binomial trees
Efficient algorithms for Fibonacci and binary Fibonacci trees
Improved computational methods for these tree structures
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Topological and Geometric Data Analysis · Synthesis and Properties of Aromatic Compounds