Cordial Labeling of Subdivision of Central Edge of Bistar Graph and Spider Graph

R Charishma; P Nageswari

doi:10.17485/IJST/v16i35.679

Article

Cordial Labeling of Subdivision of Central Edge of Bistar Graph and Spider Graph

VIEWS 408
PDF 137

Indian Journal of Science and Technology

DOI: 10.17485/IJST/v16i35.679

Year: 2023, Volume: 16, Issue: 35, Pages: 2889-2893

Original Article

Cordial Labeling of Subdivision of Central Edge of Bistar Graph and Spider Graph

R Charishma^1*, P Nageswari²

¹Research Scholar, Department of Mathematics, Noorul Islam Centre For Higher Education, Kumaracoil, Thuckalay, KanyaKumari, India
²Assistant Pofessor, Department of Mathematics, Noorul Islam Centre For Higher Education, Kumaracoil, Thuckalay, KanyaKumari, India

*Corresponding Author
Email: [email protected]

Received Date:23 March 2023, Accepted Date:02 August 2023, Published Date:25 September 2023

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

Abstract

Objectives: To analyse cordial labelling of subdivision of central edge of bistar graph and Spider graph. Methods: Cordial labeling is defined as a function g : V (q ) ! f0;1g in which each edge ab is assigned the label jg(a)􀀀g(b)j with the conditions vg(0)􀀀vg(1) 1 and eg(0)􀀀eg(1) 1 1 where v g ( 0 ) and v g ( 1 ) signify the number of vertices with 0’s and 1’s, similarly eg (0) and eg (1) signify the number of edges with 0’s and 1’s. Findings: In this paper, it is proved that subdivision of central edge of Bistar graph and spider graph with n spokes admit cordial labeling. Novelty: We have subdivided the central edge of the bistar graph with a new vertex w and analyzed for cordial labeling. We have also proved spider graph with n spokes admit cordial labeling

Keywords: Star Graph; Bistar Graph; Subdivision; Spider Graph; Cordial Labeling

References

Cahit I. Cordial graphs: a weaker version of graceful and harmonious graphs. Ars Combin. 1987;23:201–207. Available from: https://www.researchgate.net/publication/233792958_Cordial_Graphs_A_Weaker_Version_of_Graceful_and_Harmonious_Graphs
Devakirubanithi D, Jesintha J. Cordial labeling on few graphs of subdivided shell graphs. Journal of Algebraic Statistics. 2022;13(2):3455–3466. Available from: https://publishoa.com/index.php/journal/article/view/1083
Gupta P, Gupta S, Srivastav S, Ganesan G. Cordial Labeling for Star of Bistar Graph. Available from: https://ceur-ws.org/Vol-3244/PAPER_07.pdf
Elrokh A, Al-Shamiri MMA, Nada S, El-Hay AA. Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs. Journal of Mathematics. 2022;2022:1–9. Available from: https://doi.org/10.1155/2022/8521810
Gallian JA. A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics. 2020;1000:77–81. Available from: https://www.combinatorics.org/files/Surveys/ds6/ds6v25-2022.pdf

Copyright

© 2023 Charishma & Nageswari. 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)