In this article, we have introduced the concepts of divided square difference cordial labeling behavior of some special graphs called Jewel graph, Wheel graph, Helm graph, Flower graph, and Bistar.

No abstract

No abstract

In this present work, we discuss divided square difference (DSD) cordial labeling in the context of duplicating a vertex with an edge in DSD cordial graphs such as path graph, cycle graph, star graph, wheel graph, helm graph, crown graph, comb graph and snake graph.