Families of gracefuls spiders with 3l, 3l+2 and 3l-1 legs
No hay miniatura disponible
Archivos
Fecha
2024-11-07
Título de la revista
ISSN de la revista
Título del volumen
Editor
Universal Wiser Publisher PTE. LTD.
Resumen
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.
Descripción
Palabras clave
Graceful labelling, Graph labeling, Trees, Spider