Artículos Científicos

URI permanente para esta comunidad

Mostrando 1 - 2 de 2

Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs
(Universal Wiser Publisher PTE. LTD., 2025-01-21) Berrocal Huamani, Nelson; Atoche Bravo, María Jacqueline; Poma, F.
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.
Families of gracefuls spiders with 3l, 3l+2 and 3l-1 legs
(Universal Wiser Publisher PTE. LTD., 2024-11-07) Berrocal Huamani, Nelson; Atoche Bravo, María Jacqueline
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.