English

Explicit M-Polynomial and Degree-Based Topological Indices of Generalized Hanoi Graphs

Combinatorics 2026-03-31 v1 Discrete Mathematics

Abstract

The M-polynomial, introduced by Deutsch and Klav\v{z}ar in 2015, provides a unifying algebraic framework for the computation of numerous degree-based topological indices such as the Zagreb, Randic, harmonic, and forgotten indices. Despite its broad applications in chemical graph theory and network analysis, closed expressions of the M-polynomial remain unknown for many important graph families. In this work we derive, for the first time, a complete explicit expression of the M-polynomial of the generalized Hanoi graphs HpnH_p^n for arbitrary positive pp and nn. Our derivation relies on a detailed combinatorial analysis of the occupancy-based structure of HpnH_p^n, refined using Stirling and 22-associated Stirling numbers to enumerate all configurations with prescribed singleton and multiton counts. We obtain closed formulas for all diagonal and off-diagonal coefficients of the M-polynomial and show how these expressions yield exact values of the main degree-based topological indices. The correctness of the formulas is supported through numerical computation in small instances. These results provide a complete degree-based description of HpnH_p^n and make their structural complexity fully accessible through the M-polynomial framework.

Keywords

Cite

@article{arxiv.2511.12587,
  title  = {Explicit M-Polynomial and Degree-Based Topological Indices of Generalized Hanoi Graphs},
  author = {El-Mehdi Mehiri},
  journal= {arXiv preprint arXiv:2511.12587},
  year   = {2026}
}