Families of gracefuls spiders with 3l, 3l+2 and 3l-1 legs

• Autores: Berrocal Huamani, Nelson, Atoche Bravo, María Jacqueline
• Formato: otro
• Fecha de Publicación: 2024
• Institución: Universidad Nacional de Huancavelica
• Repositorio: UNH-Institucional
• Lenguaje: inglés
• OAI Identifier: oai:repositorio.unh.edu.pe:20.500.14597/9160
• Enlace del recurso: https://doi.org/10.37256/cm.5220243289; https://hdl.handle.net/20.500.14597/9160
• Nivel de acceso: acceso abierto
• Materia: Graceful labelling; Graph labeling; Trees; Spider; https://purl.org/pe-repo/ocde/ford#5.03.00

We say that a tree is a spider if has at most one vertex of degree greater than two. We prove the existence of families of graceful spiders with 3ℓ, 3ℓ+2 and 3ℓ−1 legs. We provide specific labels for each spider graph, these labels are constructed from graceful path graphs that have a particular label, so there is a correspondence between some paths and graceful spiders that we are studying, this correspondence is described in an algorithm outlined in the preliminaries.