L(2,1) Labeling of Windmill, Binomial Tree, Pan, Gear, Prism, Helm, Lilly, Hurdle, and Key Graph
Let be a graph. Let whole number-valued function such that, and are two adjacent vertices in then if and if The function is called labeling. The labeling number of , called is the smallest number for label of . In this research, we will further discuss the labeling of windmill, binomial tree, pan, gear, prism, helm, lilly, hurdle, and key graph.
Authors
- Fidelis Nofertinus Zai (ORCID: https://orcid.org/0009-0000-7760-2489)
- Lisa Damayanti Ningrum
- Noval Putra Ramadhani
Publication Details
- Journal
- Journal of Research in Mathematics Trends and Technology
- Published
- 2025-09-19
- DOI
- https://doi.org/10.32734/jormtt.v7i2.20040
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00