2017/08/30 by Numan Amin, Amin, Numan, Abdul Rauf Nizami +3
Computer Science · Mathematics · #05C12 #05C31 #Combinatorics (math.CO) #Computational Drug Discovery Methods #FOS: Mathematics #Graph theory and applications #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1708.09260
openalex publication_date 2017/08/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Hosoya polynomial of a graph G was introduced by H. Hosoya in 1988 as a counting polynomial, which actually counts the number of distances of paths of different lengths in G. The most interesting application of the Hosoya polynomial is that almost all distance-based graph invariants, which are used to predict physical, chemical and pharmacological properties of organic molecules, can be recovered from it. In this article we give the general closed form of the Hosoya polynomial of the generalized Möbius ladder M(m,n) for arbitrary m and for n=3. Moreover, we recover Wiener, hyper Wiener, Tratch-Stankevitch-Zefirov, and Harary indices from it.