Abstract
A graph called odd graceful graph if there is an injective mapping f:V(G) → {0,1,2,…,2q − 1} such that for each edge xy 6 E(G) labeled by |f(u) − f(v)|, and the results willform a label on the edge {1,3,5, …,2q − 1} which is bijective. Variabel q is the number of edges. This paper purpose is to construct the formula of odd graceful labelling on the ilalang graph (Sn , 3) and it’s variation.
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.
