• SUM CORDIAL LABELING OF ZERO-DIVISOR GRAPHS

C. SUBRAMANIAN*, T. TAMIZH CHELVAM

Abstract


Let G = (V, E) be a simple graph with n vertices. A function f : V(G) ® {0, 1} is said to be a sum cordial labeling if  for each edge e = uv, the induced map f *(uv) = (f(u) + f(v)) (mod 2) satisfies the conditions |vf(0) - vf(1)| £ 1 and    |ef(0) - ef(1)| £ 1 where vf(i)  and ef(i) are the number of vertices and edges with label i, i Î{0, 1}  respectively. A graph G is said to be sum cordial if it has a sum cordial labeling.  In this paper, we prove that certain classes of zero-divisor graphs of commutative rings are sum cordial.


Keywords


zero-divisor graph, cordial labeling, sum cordial labeling.

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.uol.edu.pk/sugar-rush/http://mysimpeg.gowakab.go.id/mysimpeg/aset/https://jurnal.jsa.ikippgriptk.ac.id/plugins/https://ppid.cimahikota.go.id/assets/demo/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/