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.