Abstract
If C_n is a cycle of length n, then the graph cycle with parallel chords is obtained from C_n by adding an “edge “is the graph obtained by attaching a pendant edge at each vertex of the cycle” C_(n.) In this paper we prove that the graphs n-for n≡0,3(mod 4). the graph P_(a,b) obtained by identifying the end points of a internally disjoint paths each of length b, are odd even graceful for odd values of a and b.
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 callMore From: International Journal of Innovative Technology and Exploring Engineering
Disclaimer: 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.
