Group S4 Difference Cordial Labeling

A Lourdusamy; nbsp E Veronisha; nbsp F Joy Beaula

doi:10.17485/IJST/v15i32.614

Article

VIEWS 755
PDF 232

Indian Journal of Science and Technology

DOI: 10.17485/IJST/v15i32.614

Year: 2022, Volume: 15, Issue: 32, Pages: 1561-1568

Original Article

Group S4 Difference Cordial Labeling

A Lourdusamy¹, E Veronisha^2,*, F Joy Beaula³

¹Department of Mathematics, St Xavier’s College, Palayamkottai -627002, India
²REG.No:19211282092009, PG and Research Department of Mathematics, St Xavier’s College
(Autonomous), Palayamkottai-627002, Manonmaniam Sundaranar University,Abishekapatti-
627012, India
³REG.No:20211282092004, PG and Research Department of Mathematics, St Xavier’s College (Autonomous), Palayamkottai-627002, Manonmaniam Sundaranar University,Abishekapatti- 627012, India

*Corresponding author
Email: [email protected]

Received Date:17 March 2022, Accepted Date:06 July 2022, Published Date:20 August 2022

This work is licensed under a Creative Commons Attribution 4.0 International License.

Abstract

Objective: To find the Group S4 difference cordial labeling of some standard graphs. Method: Path, Cycle and some standard graphs are converted into Group S4 difference cordial graphs by labeling the vertices with the elements of S4 and the edges as the difference of the order of the elements labeled to the vertices of the graph. Findings: Group S4 difference cordial labeling for path, cycle and some standard graphs. Novelty: Graph labeling can use for issues in Mobile Adhoc Networks such as connectivity, scalability, routing, modeling the network and simulation. In this paper we compute the new concept of Group S4 difference cordial labeling and also we prove that some standard graphs are Group S4 difference cordial graph. AMS Subject Classification 2010: 05C78

Keywords: Difference cordial Labeling; Path; cycle; Bistar; Comb; Ladder; S4

References

Kala R, Chandra B. Group S3 Cordial Prime Labeling of Graphs. Malaya Journal of Mathematik. 2019;1:403–407.
Kala R, Chandra B, Group D. Group S3 Cordial Prime Labeling of Some Graphs. International Journal of Applied Engineering Research. 2019;14:4203–4208. Available from: http://www.ripublication.com
Kala R, Chandra B. Group S3 Cordial Prime Labeling of Some Splitting Graphs. AIP Conference Proccedings. 2020;p. 2271.
Lourdusamy A, Wency SJ, Patrick F. Group S3 Cordial Remainder Labeling. International Journal of Recent Technology and Engineering (IJRTE). 2019;8(4):8276–8281.
Lourdusamy A, Wency SJ. Group S3 Cordial Remainder Labeling of Subdivision of Graphs. Journal Applied Mathematics and Informatics. 2020;38(3-4):221–238. Available from: https://doi.org/10.14317/jami.2020.221
Lourdusamy A, Wency SJ. Several Results On Group S3 Cordial Remainder Labeling. AIP Conference Proccedings. 2020;2261(1). Available from: https://doi.org/10.1063/5.0016883
Lourdusamy A, Wency SJ. Group S3 Cordial Remainder Labeling for Wheel and Snake Related Graphs. Jordan Journal of Mathematics and Statistics. 2021;14(2):267–286. Available from: https://doi.org/10.14317/jami.2021.223
Lourdusamy A, Wency SJ. Group S3 Cordial Remainder Labeling for Path and Cycle Related Graphs. Journal Applied Mathematics and Informatics. 2021;39:223–237.
Lourdusamy A, Veronisha E, Docxupload. Q8 difference cordial labeling. Journal of Mathematical and Computational Science. 2021;p. 2999–3009. Available from: https://doi.org/10.28919/jmcs/5622

Copyright

© 2022 Lourdusamy et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

Published By Indian Society for Education and Environment (iSee)