• EDGE-ODD GRACEFULNESS OF C5  Pn AND C5  2Pn

A. SOLAIRAJU*, G. BALASUBRAMANIAN, B. AMBIKA

Abstract


A (p, q) connected graph is edge-odd graceful graph if there exists an injective map E(G) → {1, 3, …, 2q-1} so that induced map f+: V(G) → {0,1,2,3, …, (2k-1)} defined by f+(x)ºSf(x, y)(mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes distinct labeling. In this article, the edge-odd graceful labelings of C5 Q Pn and C5 Q 2Pn are obtained.


Keywords


Graceful graph, edge-odd graceful labeling, edge-odd graceful.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter
https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://siipbang.katingankab.go.id/storage_old/maxwin/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/https://waper.serdangbedagaikab.go.id/storage/app/https://waper.serdangbedagaikab.go.id/storage/idn/