Duplicating a Vertex with an Edge in Divided Square Difference Cordial Graphs
A. Alfred Leo, R. Vikramaprasad · Mathematical Journal of Interdisciplinary Sciences · 2018
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.