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.
JoRMTT is an international blind peer-review journal dedicated to interchange for the results of research in mathematical sciences and related fields. The journal publishes papers in fundamental theory, experiments and simulation, as well as applications, with a systematic proposed method, ...