Cruz Suárez, Hugo AdánSigarreta Ricardo, Saylé CaridadCruz Suárez, Hugo Adán; 0000-0002-0732-4943Montes y Morales, Manuel2026-10-012026-10-012026-02https://hdl.handle.net/20.500.12371/33947"Based on the results of our works Maximum augmented Zagreb index on polyomino chains, which was published in the journal Applied Mathematics and Computation, and Extremal degree-based indices of general polyomino chains via dynamic programming, which is already submitted in a peer reviewed journal, in this work, we focus on the problem of finding extremal graphs with respect to degree-based topological indices, which is a major area in chemical graph theory and plays a fundamental role in the design of chemical compounds, especially as part of the QSPR analysis. In particular, we center our study in polyomino chains, which is an important graph family in the context of the extremal problem. Dividing the problem into a restricted setting and the general setting of the problem, we develop a dynamic programming framework, by means of a new encoding of polyomino chains based on local geometric descriptions which we call actions, for identifying extremal polyomino chains with respect to any degree-based topological index. Specifically, for the restricted version of the problem, our approach provides an explicit recurrence and a constructive algorithm that enable both the computation of an extremal retricted polyomino chain in linear time with respect to the number of squares and the enumeration of all extremal restricted polyomino chains in linear time with respect to their amount, being able to retrieve all non-isomorphic extremal restricted polyominoes in quadratic time with respect to the amount of extremal restricted chains".pdfengCIENCIAS FÍSICO MATEMÁTICAS Y CIENCIAS DE LA TIERRAMatemáticas--Álgebra--Análisis combinatorio--Diseño y configuraciones--PoliominósMatemáticas--Álgebra--Análisis combinatorio--Teoría de grafos--Algoritmos de grafosMatemáticas--Análisis--Métodos analíticos utilizados en la solución de problemas físicos--ProgramaciónProblemas extremos (Matemáticas)Programación dinámicaTesis de licenciaturaopenAccess