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

2 citations · 3 across the 4 of their papers we have counts for

collaborators

9 papers

math.CO2026

Rotating-Memory Fibonacci Numbers and Periodic Tilings

Walid Abdelaidoum, El-Mehdi Mehiri, Hacène Belbachir

We introduce and study the rotating-memory Fibonacci numbers, a periodic variable-order analogue of the Fibonacci sequence in which the number of preceding terms used in the recurr…

math.CO2026

The Weighted Tower of Hanoi: Algebraic Structure, Phase Transitions, and Integer Sequences

Andreas M. Hinz, El-Mehdi Mehiri

We develop a unified algebraic theory of the weighted Tower of Hanoi with arbitrary nonnegative symmetric move costs depending on both disc index and pegs. Starting from a general…

math.CO20261 cited

M-Polynomial of Product Graphs

El-Mehdi Mehiri, Sandi Klavžar

The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomi…

math.CO20252 cited

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

El-Mehdi Mehiri

The M-polynomial, introduced by Deutsch and Klavžar in 2015, provides a unifying algebraic framework for the computation of numerous degree-based topological indices such as the Za…

math.CO2025

Block-Separated Overpartitions: Fibonacci Structure and Euler Factorization

El-Mehdi Mehiri

We introduce and study block-separated overpartitions, a constrained family of overpartitions in which no two consecutive distinct part-blocks are both overlined. This local restri…

math.CO2025

Bijections Between Smirnov Words and Hamiltonian Cycles in Complete Multipartite Graphs

El-Mehdi Mehiri

We establish a bijective correspondence between Smirnov words with balanced letter multiplicities and Hamiltonian paths in complete -partite graphs . This bije…