The L(2,1) Labeling of Windmill, Binomial Tree, Pan, Gear, Prism, Helm, Lilly, Hurdle, and Key Graph

Authors

DOI:

https://doi.org/10.32734/jormtt.v7i2.20040

Keywords:

L(2,1) Labeling, Windmill, Binomial Tree, Pan, Gear

Abstract

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.

Downloads

Download data is not yet available.

Downloads

Published

2025-09-19

How to Cite

[1]
Lisa Damayanti Ningrum, Noval Putra Ramadhani, and F. N. Zai, “The L(2,1) Labeling of Windmill, Binomial Tree, Pan, Gear, Prism, Helm, Lilly, Hurdle, and Key Graph”, J. of Research in Math. Trends and Tech., vol. 7, no. 2, pp. 78–85, Sep. 2025.