Work

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

Year: 2025

Type: article

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.

Source: Journal of Research in Mathematics Trends and Technology

DOI: 10.32734/jormtt.v7i2.20040

Authors: Lisa Damayanti Ningrum, Noval Putra Ramadhani, Fidelis Nofertinus Zai

Institutions: Bandung Institute of Technology, Siliwangi University

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4414357305

FWCI:

Cites:

Cited by:

Related to: