OPTIMIZATION IN SHELL GRAPH FAMILIES THROUGH HARMONIOUS DYNAMIC COLORING
Shanthini D1, M. Raji2
1,2Vels Institute of Science, Technology and Advanced Studies, Chennai – 600117, India
1J.N.N Institute of Engineering, Thiruvallur – 601102, India
Abstract: This study introduces a new approach in graph coloring known as harmonious dynamic coloring which is useful in optimization of social network analysis, telecommunications, airspace, resource allocation and related engineering problems. The minimum quantifying colors to produce harmonious dynamic coloring is the Harmonious dynamic chromatic number. The goal of the study is to find the Harmonious dynamic chromatic number of shell graph, uniform shell bow graph, subdivided uniform shell graph, subdivided uniform shell bow graph. Furthermore, we illustrate Central graph C(G) of Shell graph and the uniform shell bow graph.
Keywords: Harmonious dynamic coloring, optimization, shell graph, uniform shell bow graph, subdivided shell graph, subdivided uniform shell bow graph, Central graph.
VOLUME 10 ISSUE 08 2026: 106 – 113