Abstract
An edge uv is said to be subdivided if the edge uv is replaced by the path P:uwv, 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 S(G). A shell graph of size n≥4, denoted C(n,n−3) is the graph obtained from the cycle Cn(v0,v1,v2,⋯,vn−1) by adding n−3 consecutive chords incident with a common vertex v0(say) called apex of the shell graph.In this paper, we show that the graph S(K2,n) is graceful and cordial, for n≥1 and the graph S(C(n,n−3)) is graceful and cordial for n≥4.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
