Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs
We say that a tree is a spider if has at most one vertex of degree greater than two. We obtain existence of families of gracefuls spiders with ℓ(2k +1)−k, ℓ(2k +1)−k +1 and ℓ(2k +1)+k +1 legs. We provide specific labels for each spider graph, these labels are constructed from graceful path graphs th...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2025 |
| País: | Perú |
| Institución: | Universidad Nacional de Huancavelica |
| Repositorio: | UNH-Institucional |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.unh.edu.pe:20.500.14597/9165 |
| Acceso en línea: | https://doi.org/10.37256/cm.6120255497 https://hdl.handle.net/20.500.14597/9165 |
| Access Level: | acceso abierto |
| Palabra clave: | Graceful labeling Graph labeling Tree Spider https://purl.org/pe-repo/ocde/ford#1.01.00 |
| Sumario: | We say that a tree is a spider if has at most one vertex of degree greater than two. We obtain existence of families of gracefuls spiders with ℓ(2k +1)−k, ℓ(2k +1)−k +1 and ℓ(2k +1)+k +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 acorrespondence between some paths and graceful spiders that we are studying, this correspondence is described in an algorithm outlined in the preliminaries. |
|---|