Consider g : V (G) → {0, 1, 2} such that |νg(ℓ) − νg(j)| ≤ 1 and |eg(ℓ) − eg(j)| ≤ 1 for any ℓ, j ∈ {0, 1, 2}, where νg(ℓ) denotes the number of vertices labeled with ℓ, eg(ℓ) denotes the number of edges ηβ with (g(η) + g(β)) ≡ ℓ (mod 3). Then g is called total 3-sum cordial labeling. A graph with a total 3-sum cordial labeling is called a total 3-sum cordial graph. We study the total 3-sum cordial labeling of zero-divisor graphs.

1.
F.
Harary
, Graph Theory (
Addison-wesley
,
Reading, Mass
,
1972
).
2.
A.
Rosa
, “
On certain valuations of the vertices of a graph
,”
Theory of Graphs
(Rome, July
1966
), Gordon and
Breach
,
N. Y.
 and
Paris
,
349
–
355
(1967).
Google Scholar
 
3.
J. A.
Gallian
, “
A dynamic survey of graph labeling
,”
The Electronic J. Combin.
22
(
2019
).
Google Scholar
 
4.
I.
Cahit
, “
Cordial graphs: A weaker version of graceful and harmonious graphs
,”
Ars Combin.
23
,
201
–
207
(
1987
).
Google Scholar
 
5.
S. P.
Selvam
 and
G.
Lathamaheswari
, “
Total 3-sum cordial labeling
,”
IJMA
5
(
5
) (
2014
).
Google Scholar
 
6.
I.
Beck
, “
Coloring of commutative rings
,”
J. Algebra
116
,
208
–
226
(
1988
).
https://doi.org/10.1016/0021-8693(88)90202-5
Google Scholar
Crossref
Search ADS
 
7.
D. F.
Anderson
 and
P. S.
Livingston
, “
The zero-divisor graph of a commutative ring
,”
J. Algebra
217
,
434
–
447
(
1999
).
https://doi.org/10.1006/jabr.1998.7840
Google Scholar
Crossref
Search ADS
 
8.
T. T.
Chelvam
 and
C.
Subramanian
, “
Sum cordial labeling of zero-divisor graphs
,”
International Journal of Mathematical Archive
9
(
2
),
146
–
151
(
2018
).
Google Scholar
 
This content is only available via PDF.
©2023 Authors. Published by AIP Publishing.
2023
Author(s)
You do not currently have access to this content.