Abstract
|E(G)| in graph G is considered to be edge-odd graceful if it has a bijective mapping f from |E(G)| to the positive integer set {1, 3, 5,…, (2q - 1) which induces the mapping f* from |V (G)| to {0, 1, 2, 3,…, 2q} is injective. Given by f*(u) Σ {f (uv) : uv ∈ E} (mod2q) with p vertices, the integers assigned to the vertices are distinct. The graph which permits an edge-odd graceful labeling is an edge-odd graceful graph. In the present article, the EOG of lict and litact graphs for few types of graphs are investigated.
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.
