Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs
Descripción del Articulo
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: | , , |
|---|---|
| Formato: | artículo |
| Fecha de Publicación: | 2025 |
| Institución: | Universidad Nacional de Huancavelica |
| Repositorio: | UNH-Institucional |
| Lenguaje: | inglés |
| OAI Identifier: | oai:repositorio.unh.edu.pe:20.500.14597/9165 |
| Enlace del recurso: | https://doi.org/10.37256/cm.6120255497 https://hdl.handle.net/20.500.14597/9165 |
| Nivel de acceso: | acceso abierto |
| Materia: | Graceful labeling Graph labeling Tree Spider https://purl.org/pe-repo/ocde/ford#1.01.00 |
| id |
RUNH_63c45ee5e558eb1e1652d8d98eb7fedb |
|---|---|
| oai_identifier_str |
oai:repositorio.unh.edu.pe:20.500.14597/9165 |
| network_acronym_str |
RUNH |
| network_name_str |
UNH-Institucional |
| repository_id_str |
. |
| spelling |
Berrocal Huamani, NelsonAtoche Bravo, María JacquelinePoma, F.2025-06-09T15:14:45Z2025-06-09T15:14:45Z2025-01-21We 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.https://doi.org/10.37256/cm.6120255497https://hdl.handle.net/20.500.14597/9165engUniversal Wiser Publisher PTE. LTD.2705-1056info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by/4.0/Graceful labelingGraph labelingTreeSpiderhttps://purl.org/pe-repo/ocde/ford#1.01.00Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionreponame:UNH-Institucionalinstname:Universidad Nacional de Huancavelicainstacron:UNHORIGINALCM-5497-final.pdfCM-5497-final.pdfapplication/pdf935662https://repositorio.unh.edu.pe/bitstreams/ca5816c8-1243-4ee8-aaa1-2d29fab6464e/download0397a87faeef6ee7a9aa99a3cd6b76a4MD51LICENSElicense.txtlicense.txttext/plain; charset=utf-844https://repositorio.unh.edu.pe/bitstreams/6039c49a-02a6-4bec-a9df-4f72fd597502/downloada0ebbeafb9d2ec7cbb19d7137ebc392cMD5220.500.14597/9165oai:repositorio.unh.edu.pe:20.500.14597/91652025-10-27 12:54:40.525https://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccesshttps://repositorio.unh.edu.peUniversidad Nacional de Huancavelicarepositorio@unh.edu.peaHR0cHM6Ly9jcmVhdGl2ZWNvbW1vbnMub3JnL2xpY2Vuc2VzL2J5LzQuMC8= |
| dc.title.none.fl_str_mv |
Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs |
| title |
Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs |
| spellingShingle |
Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs Berrocal Huamani, Nelson Graceful labeling Graph labeling Tree Spider https://purl.org/pe-repo/ocde/ford#1.01.00 |
| title_short |
Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs |
| title_full |
Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs |
| title_fullStr |
Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs |
| title_full_unstemmed |
Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs |
| title_sort |
Families of Graceful Spiders with (2k+1)k, (2k+1)k+1 and (2k+1)+k+1 Legs |
| author |
Berrocal Huamani, Nelson |
| author_facet |
Berrocal Huamani, Nelson Atoche Bravo, María Jacqueline Poma, F. |
| author_role |
author |
| author2 |
Atoche Bravo, María Jacqueline Poma, F. |
| author2_role |
author author |
| dc.contributor.author.fl_str_mv |
Berrocal Huamani, Nelson Atoche Bravo, María Jacqueline Poma, F. |
| dc.subject.none.fl_str_mv |
Graceful labeling Graph labeling Tree Spider |
| topic |
Graceful labeling Graph labeling Tree Spider https://purl.org/pe-repo/ocde/ford#1.01.00 |
| dc.subject.ocde.none.fl_str_mv |
https://purl.org/pe-repo/ocde/ford#1.01.00 |
| description |
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. |
| publishDate |
2025 |
| dc.date.accessioned.none.fl_str_mv |
2025-06-09T15:14:45Z |
| dc.date.available.none.fl_str_mv |
2025-06-09T15:14:45Z |
| dc.date.issued.fl_str_mv |
2025-01-21 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article |
| dc.type.version.none.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
| format |
article |
| status_str |
publishedVersion |
| dc.identifier.doi.none.fl_str_mv |
https://doi.org/10.37256/cm.6120255497 |
| dc.identifier.uri.none.fl_str_mv |
https://hdl.handle.net/20.500.14597/9165 |
| url |
https://doi.org/10.37256/cm.6120255497 https://hdl.handle.net/20.500.14597/9165 |
| dc.language.iso.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.issn.none.fl_str_mv |
2705-1056 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess |
| dc.rights.uri.none.fl_str_mv |
https://creativecommons.org/licenses/by/4.0/ |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
https://creativecommons.org/licenses/by/4.0/ |
| dc.publisher.none.fl_str_mv |
Universal Wiser Publisher PTE. LTD. |
| publisher.none.fl_str_mv |
Universal Wiser Publisher PTE. LTD. |
| dc.source.none.fl_str_mv |
reponame:UNH-Institucional instname:Universidad Nacional de Huancavelica instacron:UNH |
| instname_str |
Universidad Nacional de Huancavelica |
| instacron_str |
UNH |
| institution |
UNH |
| reponame_str |
UNH-Institucional |
| collection |
UNH-Institucional |
| bitstream.url.fl_str_mv |
https://repositorio.unh.edu.pe/bitstreams/ca5816c8-1243-4ee8-aaa1-2d29fab6464e/download https://repositorio.unh.edu.pe/bitstreams/6039c49a-02a6-4bec-a9df-4f72fd597502/download |
| bitstream.checksum.fl_str_mv |
0397a87faeef6ee7a9aa99a3cd6b76a4 a0ebbeafb9d2ec7cbb19d7137ebc392c |
| bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
| repository.name.fl_str_mv |
Universidad Nacional de Huancavelica |
| repository.mail.fl_str_mv |
repositorio@unh.edu.pe |
| _version_ |
1849234206944657408 |
| score |
13.378399 |
Nota importante:
La información contenida en este registro es de entera responsabilidad de la institución que gestiona el repositorio institucional donde esta contenido este documento o set de datos. El CONCYTEC no se hace responsable por los contenidos (publicaciones y/o datos) accesibles a través del Repositorio Nacional Digital de Ciencia, Tecnología e Innovación de Acceso Abierto (ALICIA).
La información contenida en este registro es de entera responsabilidad de la institución que gestiona el repositorio institucional donde esta contenido este documento o set de datos. El CONCYTEC no se hace responsable por los contenidos (publicaciones y/o datos) accesibles a través del Repositorio Nacional Digital de Ciencia, Tecnología e Innovación de Acceso Abierto (ALICIA).
