Noval Putra Ramadhani
Universitas Siliwangi

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

The L(2,1) Labeling of Windmill, Binomial Tree, Pan, Gear, Prism, Helm, Lilly, Hurdle, and Key Graph Lisa Damayanti Ningrum; Noval Putra Ramadhani; Fidelis Nofertinus Zai
Journal of Research in Mathematics Trends and Technology Vol. 7 No. 2 (2025): Journal of Research in Mathematics Trends and Technology (JoRMTT)
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32734/jormtt.v7i2.20040

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.