Families of Graceful Spiders with 3ℓ, 3ℓ + 2 and 3ℓ – 1 Legs

Authors

DOI:

https://doi.org/10.37256/cm.5220243289

Keywords:

graceful labelling, graph labeling, trees, spider

Abstract

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 31 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.

Downloads

Published

2024-11-07

How to Cite

1.
Huamaní NB, Bravo MA. Families of Graceful Spiders with 3ℓ, 3ℓ + 2 and 3ℓ – 1 Legs. Contemp. Math. [Internet]. 2024 Nov. 7 [cited 2024 Dec. 10];5(4):4908-20. Available from: https://ojs.wiserpub.com/index.php/CM/article/view/3289