Explicit Constructions of Hetro Cordial Labelings for Selected Graphs

Authors

  • S Jackson Assistant Professor, P. G and Research Department of Mathematics, V. O. Chidambaram College, Thoothukudi-628008, Affiliated to Manonmaniam Sundaranar University, Tirunelveli-627012, India. Author
  • S Rohini M. Sc in Mathematics (2024-26), P.G and Research Department of Mathematics, V. O. Chidambaram College, Thoothukudi-628008, Affiliated to Manonmaniam Sundaranar University, Tirunelveli-627012, India. Author
  • M Abirami Ph. D Scholar of Mathematics, P.G and Research Department of Mathematics, V. O. Chidambaram College, Thoothukudi-628008, Affiliated to Manonmaniam Sundaranar University, Tirunelveli-627012, India. Author

DOI:

https://doi.org/10.71426/jasm.v2.i2.pp155-160

Keywords:

Hetro Cordial Labeling, Hetro Cordial Labeling Graph

Abstract

Hetro Cordial Labeling (HCL) is a graph labeling technique in which a bijection assigns labels from {0, 1} to the vertices of a graph, and the induced edge labeling is determined by the labels of the corresponding end vertices. A graph is said to admit HCL when the numbers of vertices and edges receiving the labels 0 and 1 differ by at most one. In this paper, the Hetro Cordial Labeling property is investigated for several classes of graphs. Explicit vertex and induced edge labeling schemes are constructed for the Lotus Inside a Circle (LCₙ), Twig (T₍gₙ₎), Krackhardt Kite, Bull, and Fish graphs. For each graph, the proposed labeling satisfies the required balance conditions on the vertex and edge labels. These results establish that the considered graphs admit Hetro Cordial Labeling and contribute to the study of the labeling properties of specific graph structures.

References

[1] Cahit I. Cordial graphs: a weaker version of graceful and harmonious graphs. Ars Combinatoria. 1987;23:201–207.

[2] Gallian JA. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics. 2023;DS6. Available from: https://doi.org/10.37236/27

[3] AbdAllah MA, Nada SI, Al-Shamiri MMA, Afify MA. Cyclic cordial labeling for the lemniscate graphs and their second powers. Journal of Mathematics. 2025;2025(1):8448683. Available from: https://doi.org/10.1155/jom/8448683

[4] Nellai Murugan A, Selva Vidhya V, Mariasingam M. Tree related hetro-cordial graphs. International Journal of Scientific Engineering and Applied Science. 2015;1(7):183–188. Available from: https://ijseas.com/volume1/v1i7/ijseas20150721.pdf

[5] Cichacz S. E-cordial labeling of graphs and its implications for A-antimagic labeling of trees. Discrete Mathematics. 2025;348(9):114493. Available from: https://doi.org/10.1016/j.disc.2025.114493

[6] Idrees N, Nasir S, Farooq FB, Majeed M. On certain prime cordial families of graphs. Journal of Taibah University for Science. 2020;14(1):579–584. Available from: https://doi.org/10.1080/16583655.2020.1756561

[7] Ullah R, Rahmat G, Numan M, Yannick KA, Aslam A. 3-total edge product cordial labeling for stellation of square grid graph. Journal of Mathematics. 2021;2021:1724687. Available from: https://doi.org/10.1155/2021/1724687

[8] Elrokh A, Al-Shamiri MMA, Nada S, Abd El-Hay A. Cordial and total cordial labeling of corona product of paths and second order of lemniscate graphs. Journal of Mathematics. 2022;2022:8521810. Available from: https://doi.org/10.1155/2022/8521810

[9] Elrokh A, Al-Shamiri MMA, Almazah MMA, Abd El-Hay A. A novel problem for solving permuted cordial labeling of graphs. Symmetry. 2023;15(4):825. Available from: https://doi.org/10.3390/sym15040825

[10] Abdel-Aal ME, Bashammakh SA. A study on the varieties of equivalent cordial labeling graphs. AIMS Mathematics. 2024;9(12):34720–34733. Available from: https://doi.org/10.3934/math.20241653

[11] Muthulakshmi C, Nivetha AA. Exploring mean cordial labeling possible combination position of vertices in graphs: a computational approach. Indian Journal of Science and Technology. 2024;17(39):4111–4118. Available from: https://doi.org/10.17485/IJST/v17i39.2915

[12] Vertudes JCM, Pedrano AC. On topological cordial labeling of some graphs. European Journal of Mathematics and Statistics. 2025;6(4):1–7. Available from: https://doi.org/10.24018/ejmath.2025.6.4.404

[13] Sudha A, Jeyanthi P, Chinnathambi K, Kalaivani K, Dabke D. Fuzzy graph theory and neuromorphic graph models for uncertain mathematical systems. Journal of Applied Sciences and Modelling. 2026;2(1):83–100. Available from: https://doi.org/10.71426/jasm.v2.i1.pp83-100

Downloads

Published

2026-10-17

Issue

Vol. 2 No. 2 (2026): Volume 2, Issue 2, July - December 2026

Section

Research Article

License

Copyright (c) 2026 S Jackson, S Rohini, M Abirami (Author)

Creative Commons License

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

Authors retain copyright in their published work subject to the journal's publication and licensing arrangements.

Articles published in Journal of Applied Sciences and Modelling  are distributed under the Creative Commons Attribution–NonCommercial 4.0 International License (CC BY-NC 4.0).

Under this license, readers may share and adapt published material for non-commercial purposes, provided that:

  • Appropriate credit is given to the author or authors.
  • The original publication source is acknowledged.
  • A link to the applicable license is provided.
  • Any modifications are clearly indicated.

Commercial reuse is not permitted under CC BY-NC 4.0 without appropriate authorization from the relevant rights holder.

License details are available at:

Creative Commons Attribution–NonCommercial 4.0 International

How to Cite

[1]
S. Jackson, S Rohini, and M. Abirami, “Explicit Constructions of Hetro Cordial Labelings for Selected Graphs”, Journal of Applied Sciences and Modelling, vol. 2, no. 2, pp. 155–160, Oct. 2026, doi: 10.71426/jasm.v2.i2.pp155-160.