Graceful Labeling of Spider Graphs With at Most Five Legs

A. Panpa, S. Imnang and T. Wasuanankul

Journal of Applied Mathematics, 2025, vol. 2025, 1-5

Abstract: A graceful labeling of a graph G with q edges is an injection f from the vertices of G to the set 0,1,⋯,q such that, when each edge uv is assigned the label fu−fv, the resulting edge labels are distinct. A spider graph is a tree with exactly one vertex of degree greater than 2, and this vertex is called the branch vertex. A leg of a spider graph is a path from the branch vertex to a leaf of the tree. We show that there exists graceful labeling of spider graphs with at most five legs.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jam/2025/5826777.pdf (application/pdf)
http://downloads.hindawi.com/journals/jam/2025/5826777.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:5826777

DOI: 10.1155/jama/5826777

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().