Subdivision of wheel is graceful and cordial

G. Sethuraman, K. Sankar
2015 International Journal of Mathematical Analysis  
An edge uv is said to be subdivided if the edge uv is replaced by the path uwv P : , where w is the new vertex. A graph obtained by subdividing each edge of a graph G is called subdivision of the graph G , and is denoted by ) (G S . In this paper, we show that the subdivision of wheel graph ( ) n SW is graceful for even values of 4  n and cordial for all 4  n .
doi:10.12988/ijma.2015.5375 fatcat:2h6zt35vvzelrljfbhwnamppmy