Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs
| dc.contributor.author | Berrocal Huamani, Nelson | |
| dc.contributor.author | Atoche Bravo, María Jacqueline | |
| dc.contributor.author | Poma, F. | |
| dc.date.accessioned | 2025-06-09T15:14:45Z | |
| dc.date.available | 2025-06-09T15:14:45Z | |
| dc.date.issued | 2025-01-21 | |
| dc.description.abstract | 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. | |
| dc.fecha.inicio | 2024-08-15 | |
| dc.format | application/pdf | |
| dc.identifier.doi | https://doi.org/10.37256/cm.6120255497 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14597/9165 | |
| dc.language.iso | eng | |
| dc.publisher | Universal Wiser Publisher PTE. LTD. | |
| dc.publisher.country | Singapur | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | Graceful labeling | |
| dc.subject | Graph labeling | |
| dc.subject | Tree | |
| dc.subject | Spider | |
| dc.subject.ocde | https://purl.org/pe-repo/ocde/ford#1.01.00 | |
| dc.title | Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs | |
| dc.type | info:eu-repo/semantics/other | |
| dc.type.version | info:eu-repo/semantics/publishedVersion | |
| renati.author.dni | 47626281 | |
| renati.author.orcid | https://orcid.org/0000-0001-8554-3503 |