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

dc.contributor.authorBerrocal Huamani, Nelson
dc.contributor.authorAtoche Bravo, María Jacqueline
dc.date.accessioned2025-06-06T21:47:10Z
dc.date.available2025-06-06T21:47:10Z
dc.date.issued2024-11-07
dc.description.abstractWe 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.
dc.fecha.inicio2023-06-27
dc.formatapplication/pdf
dc.identifier.doihttps://doi.org/10.37256/cm.5220243289
dc.identifier.urihttps://hdl.handle.net/20.500.14597/9160
dc.language.isoeng
dc.publisherUniversal Wiser Publisher PTE. LTD.
dc.publisher.countrySingapur
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectGraceful labelling
dc.subjectGraph labeling
dc.subjectTrees
dc.subjectSpider
dc.subject.ocdehttps://purl.org/pe-repo/ocde/ford#5.03.00
dc.titleFamilies of gracefuls spiders with 3l, 3l+2 and 3l-1 legs
dc.typeinfo:eu-repo/semantics/other
dc.type.versioninfo:eu-repo/semantics/publishedVersion
renati.author.dni47626281
renati.author.orcidhttps://orcid.org/0000-0001-8554-3503
Archivos
Bloque original
Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
CM-3289.pdf
Tamaño:
1014.72 KB
Formato:
Adobe Portable Document Format
Descripción:
Bloque de licencias
Mostrando 1 - 1 de 1
Cargando...
Miniatura
Nombre:
license.txt
Tamaño:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descripción: