Indian Journal of Science and Technology
Year: 2022, Volume: 15, Issue: 32, Pages: 1561-1568
Original Article
A Lourdusamy1, E Veronisha2,*, F Joy Beaula3
1Department of Mathematics, St Xavier’s College, Palayamkottai -627002, India
2REG.No:19211282092009, PG and Research Department of Mathematics, St Xavier’s College
(Autonomous), Palayamkottai-627002, Manonmaniam Sundaranar University,Abishekapatti-
627012, India
3REG.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
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
© 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)
Subscribe now for latest articles and news.