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.
Highlights
IntroductionWe mean a finite, undirected graph without loops and multiple edges. For basic definitions we refer Harary [8]
By a graph, we mean a finite, undirected graph without loops and multiple edges
A graph got by duplicating a vertex vk with an edge e ′(= u′v′) in a divided square difference (DSD) cordial path Pn (except n ≡ 2(mod 4))
Summary
We mean a finite, undirected graph without loops and multiple edges. For basic definitions we refer Harary [8]. A dynamic survey on different graph labeling was found in Gallian [7]. Cordial labeling was introduced by Cahit [5]. A. Alfred Leo et al [1] introduced divided square difference cordial labeling graphs. The motivation behind the divided square difference cordial labeling is due to R. Dhavaseelan et al on their work even sum cordial labeling graphs [6]. Vaidya et al on their work [12] In this present work, we discuss divided square difference (DSD) cordial labeling in the context of duplication of a vertex by an edge in DSD cordial graphs such as path graph, cycle graph, star graph, wheel graph, helm graph, bistar graph, crown graph, comb graph and snake graph
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
