Extremal degree-based indices of general polyomino chains via dynamic programming
This paper introduces a dynamic programming framework to identify extremal general polyomino chains for degree-based topological indices, specifically resolving a 2015 open problem by characterizing the chains that maximize the generalized Randić index with based on the number of squares modulo 4.