Extremal degree-based topological indices of general polyomino chains via dynamic programming

Simple item page
dc.audiencegeneralPublic
dc.contributorCruz Suárez, Hugo Adán
dc.contributorSigarreta Ricardo, Saylé Caridad
dc.contributor.advisorCruz Suárez, Hugo Adán; 0000-0002-0732-4943
dc.contributor.authorMontes y Morales, Manuel
dc.creatorMontes y Morales, Manuel; 0009-0007-0313-1814
dc.date.accessioned2026-10-01T21:10:29Z
dc.date.available2026-10-01T21:10:29Z
dc.date.issued2026-02
dc.description.abstract"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".
dc.folio20260312093929-2185-TL
dc.formatpdf
dc.identificator1
dc.identifier.urihttps://hdl.handle.net/20.500.12371/33947
dc.language.isoeng
dc.matricula.creator202131358
dc.publisherBenemérita Universidad Autónoma de Puebla
dc.rights.accesopenAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.subject.classificationCIENCIAS FÍSICO MATEMÁTICAS Y CIENCIAS DE LA TIERRA
dc.subject.lccMatemáticas--Álgebra--Análisis combinatorio--Diseño y configuraciones--Poliominós
dc.subject.lccMatemáticas--Álgebra--Análisis combinatorio--Teoría de grafos--Algoritmos de grafos
dc.subject.lccMatemáticas--Análisis--Métodos analíticos utilizados en la solución de problemas físicos--Programación
dc.subject.lccProblemas extremos (Matemáticas)
dc.subject.lccProgramación dinámica
dc.thesis.careerLicenciatura en Matemáticas
dc.thesis.degreedisciplineÁrea de Ingeniería y Ciencias Exactas
dc.thesis.degreegrantorFacultad de Ciencias Físico Matemáticas
dc.thesis.degreetoobtainLicenciado (a) en Matemáticas
dc.titleExtremal degree-based topological indices of general polyomino chains via dynamic programming
dc.typeTesis de licenciatura
dc.type.conacytbachelorThesis
dc.type.degreeLicenciatura
Files
Original bundle
Now showing 1 - 2 of 2
Name:
20260312093929-2185-TL.pdf
Size:
1.48 MB
Format:
Adobe Portable Document Format
Download
Name:
20260312093929-2185-CARTA.pdf
Size:
173.21 KB
Format:
Adobe Portable Document Format
Collections
Tesis de Licenciatura