Abstract
The aim of this study is to obtain the lower and upper bounds for the distance-based Wiener index, Hyper-Wiener index and Harary index of the Fibonacci-sum graph. Firstly, the shortest distance of the vertices in the Fibonacci-sum graph is characterized. Afterwards, the numbers of decision vertices and leaves are obtained by applying the BFS algorithm to the Fibonacci-sum graph.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call