Abstract
Let G be a connected simple graph. A graph H is said to be a m-Super subdivision of G, if every edge of G is replaced by the complete bipartite graph Km,m with m > 2 in such a way that the end vertices of the edge are merged with any two vertices of the same partite set A or B of Km,m after removal of the edge of G. In this paper, we prove that m-Super subdivision of path and cycle are graceful.
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: Journal of Discrete Mathematical Sciences and Cryptography
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.
