Abstract
An edge-graceful labeling of a finite simple graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1,2,⋯,q} such that the vertex sums are pairwise distinct modulo p, where the vertex sum at a vertex is the sum of labels of all edges incident to such vertex. A graph is called edge-graceful if it admits an edge-graceful labeling. In this article, we verify that an regular graph of odd degree is edge-graceful if it contains either of two particular 3-regular spanning subgraphs, namely, a quasi-prism factor and a claw factor.
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.
