• SOME STAR AND BISTAR RELATED SIGNED PRODUCT CORDIAL GRAPHS

SANTHI. M*, JAMES ALBERT

Abstract


A vertex labeling f: V(G)→{-1, 1} of a graph G with induced edge labeling f*:E(G)→ {-1, 1} defined by                  f*(uv) = f(u)f(v) is called a signed product cordial labeling if and where vf (-1) is the number of vertices labeled with ‘-1’ and vf (1) is the number of vertices labeled with ‘+1’, ef(-1) is the number of edges labeled with ‘-1’ and ef(1) is the number of edges labeled with ‘+1’.A graph with a signed product cordial labeling is called a signed product cordial graph. In this paper, we prove that splitting graphs of star K1,n and Bistar Bn,n are signed product cordial graphs.


Keywords


Signed product cordial labeling, Signed product cordial graph.

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/