Graph labeling has developed into one of the important areas in graph theory for last few years. Though graph labeling is considered primarily a theoretical subject in graph theory, it serves as models for variety of applications. We introduced the concept of group S3 cordial remainder labeling in [1]. In this paper, we prove that shadow graph of cycle and path, splitting graph of cycle, armed crown, umbrella graph and dumbbell graph admit a group S3 cordial remainder labeling. Also we prove that snake related graphs are a group S3 cordial remainder graphs.
Topics
Graph theory
REFERENCES
1.
A.
Lourdusamy
, S. J.
Wency
, and F.
Patrick
, “Group s3 cordial remainder labeling
,” International Journal of Recent Technology and Engineering
8,
8276
–8281
(2019
).2.
3.
A.
Rosa
, “On certain valuations of the vertices of a graph
,” , 349
–355
(1967
), theory of Graphs
(Rome, July 1966), Gordon and Breach, N. Y. and Paris.4.
J. A.
Gallian
, “A dynamic survey of graph labeling
,” The Electronic J. Combin.
22
(2019
).5.
6.
A.
Lourdusamy
, S. J.
Wency
, and F.
Patrick
, “Group s3 cordial remainder labeling for wheel and snake related graphs
,” (2019
), (submitted).7.
A.
Lourdusamy
, S. J.
Wency
, and F.
Patrick
, “Group s3 cordial remainder labeling for path and cycle related graphs
,” (2019
), (submitted).8.
A.
Lourdusamy
, S. J.
Wency
, and F.
Patrick
, “Group s3 cordial remainder labeling for subdivision of graphs
,” (2019
), (submitted).9.
A.
Lourdusamy
, S. J.
Wency
, and F.
Patrick
, “Some result on group s3 cordial remainder graphs
,” (2019), (submitted)
.10.
A.
Lourdusamy
and F.
Patrick
, “Sum divisor cordial labeling for path and cycle related graphs
,” Journal ofPrime Research in Mathematics
15
, 101
–114
(2019
).11.
A.
Lourdusamy
and F.
Patrick
, “Sum divisor cordial labeling for path and cycle related graphs
,” Proyecciones Journal of Mathematics
35,
437
–455
(2016
).
This content is only available via PDF.
© 2020 Author(s).
2020
Author(s)
You do not currently have access to this content.
