Two families of graceful cacti

Authors

Christian Barrientos, University of South Florida, TampaFollow

DOI Link

https://doi.org/10.70013/s8t4q6v1

Abstract

We present a graceful labeling for each member of a subfamily of quadrangular cacti whose underlying graph correspond to the subclass of rooted binary trees where every level has at most two vertices. We also prove the existence of an $\alpha$-labeling (the most restricted type of graceful labeling) for all cyclic snakes, i.e., those cacti whose blocks are copies of the cycle $C_{4n}$ and its maximum degree is four.

Author ORCID Identifier

https://orcid.org/0000-0003-2838-8687

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Recommended Citation

Barrientos, Christian (2025) "Two families of graceful cacti," Communications on Number Theory and Combinatorial Theory: Vol. 6, Article 1.
DOI: 10.70013/s8t4q6v1
Available at: https://research.library.kutztown.edu/contact/vol6/iss1/1