What type of study is this?

This is a Quantitative Study study.

September 20, 2025Open Access

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

Key Points

The study aims to define the labeling function for various graph types, including windmill and prism.
Key findings relate to the smallest number needed for labeling different types of graphs, specifically windmill and key graph.
Labeling number is critical to understanding graph properties, particularly for structures like the binomial tree.
The research explores various graphs, including gear and helm, indicating their distinct labeling requirements.

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.

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

Key Points

Abstract

Cite This Study

Also Consider

Also Consider