This research discusses labeling in various graph types like windmill and binomial tree, suggesting new insights on their properties.
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.
No takes yet. Share an insight, caveat, or question.
Ningrum et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: