Computation of Topological Indices of Binary and Ternary Trees using Algorithmic Approach
نویسندگان
1 Department of Computer Science, College of Engineering and Computer Science, Jazan University, Jazan, Saudi Arabia
2 Division of Computing, Analytics and Mathematics School of Science and Engineering University of Missouri- Kansas City, MO 64110, USA
3 Special Interest Group of Modeling and Data Analytics (SIGMDA), Faculty of Computer Science and Mathematics, Universiti Malaysia, Terengganu 21030 Kuala Nerus, Terengganu, Malaysia
4 Deanship of Human Resources and Information Technology, Jazan University, Jazan, Saudi Arabia
doi
10.22052/ijmc.2024.252698.1701چکیده
In this paper, algorithms are used to compute distance-based topological indices for the Complete Binary Tree (CBT) and the Complete Ternary Tree (CTT). Computation of distance-based topological indices is complex for varied heights of CBT and CTT. Hence designed algorithms to compute distance between any-to-any vertex made this possible to compute the required topological indices for CBT and CTT. The distance calculator algorithm designed for this study can also be customized in digital chemical structures, mathematical chemistry, network traffic control in wireless networks, search applications, high bandwidth routing, parse construction in compilers, and memory management.
