Computation of Topological Indices of Binary and Ternary Trees using Algorithmic Approach

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Elahi Kashif; Ahmad Ali; Asim Muhammad Ahsan; Hasni Roslan

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Chemistry Year:2024 | Volume:15 | Issue:2 Page(s): 107-115

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Computation of Topological Indices of Binary and Ternary Trees using Algorithmic Approach

Author(s)

Elahi Kashif | Ahmad Ali | Asim Muhammad Ahsan | Hasni Roslan | Issue Writer Certificate

Keywords

algorithms

Distance

Binary tree

Ternary tree

Topological indices

Abstract

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans