Skip to content

Archives › Volume 10, Number 2 (2020)

J. Math. Comput. Sci. 10 (2020), 309–315

Several result on SD-prime cordial graphs

S. Jenifer Wency, A. Lourdusamy

Abstract

A bijection f: V(G) → {1,2,··· ,|V(G)|} induces an edge labeling f∗: E(G) → {0,1} such that for any edge uv in G, f∗(uv) = 1 if gcd(S,D) = 1 and f∗(uv) = 0 otherwise, where S = f(u)+ f(v) and D = |f(u)− f(v)|. The labeling f is called SD-prime cordial labeling if |ef∗(0) − ef∗(1)|≤1. We say that G is SD-prime cordial graph if it admits SD-prime cordial labeling. In this paper, we prove that certain classes of zero-divisor graphs of commutative rings are SD-prime cordial graphs.

Published
18 December 2019
Volume
10 (2020)
License
CC BY 3.0

Copyright © 2019 S. Jenifer Wency, A. Lourdusamy. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Cite this article

S. J. Wency, A. Lourdusamy, Several result on SD-prime cordial graphs, J. Math. Comput. Sci. 10 (2020), 309–315. https://doi.org/10.28919/jmcs/4362

BibTeX
@article{Wency2020,
  author  = {Wency, S. Jenifer and Lourdusamy, A.},
  title   = {Several result on SD-prime cordial graphs},
  journal = {J. Math. Comput. Sci.},
  volume  = {10},
  year    = {2020},
  pages   = {309--315},
  doi     = {10.28919/jmcs/4362}
}