Abstract
A simple graph G=(V, E) with n vertices and m edges is called graceful, if that graph G can be labeled with a bijection f:V(G) {1, 2, .., n} and g:E(G) {1, 2, .., m}, with condition label on any edge equals the difference between the labels of the two endpoints. This study examined graceful labeling on path graph Pn for n>=3.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.