Graceful Labeling of Some Spider Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i2.5305Keywords:
spider graph, graceful, inverse tranformationAbstract
A graceful labeling of a tree $T$ with $n$ edges is a bijection $f : V(T) \longrightarrow \{0,1,2, \ldots n\}$ such that $\{|f(u)-f(v)| : uv \in E(T)\}$ equal to $\{1,2,3,\ldots,n\}$. A spider graph is a tree with one vertex of degree at least $3$ and all others with degree at most $2$. We show that some classes of spider graphs admit graceful labeling.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Kittisak Saengsura, Tiang Poomsa-ard
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.