Integrating Fuzzy Graceful Labeling for Enhanced Prediction of Radiation Intensity in Holography

Document Type : Regular article

Authors

1 Department of Mathematics, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai – 600062, India

2 Canadian Quantum Research Center, 106-460 Doyle Ave, Kelowna, British Columbia V1Y 0C2, Canada

3 Department of Physics, Sar.C., Islamic Azad University, Sari, Iran

Abstract

The multiple classes of graphs that can be labeled gracefully are defined using the principles of neutrosophy. By imposing structural and labeling constraints on the graph, it becomes possible to define the n-th position uniquely under neutrosophic fuzzy conditions. The variety of vertex labels and edge labels may coincide for more than one vertex, and a complete proof of existence is provided for the neutrosophic fuzzy labeling of the graphs discussed in this research. Using the neutrosophic fuzzy framework, all three forms of uncertainty in the labeling process are effectively represented. In this work, neutrosophic fuzzy graceful labeling is further connected to applications involving UV rays generated from a point source and holography. The uncertainty-handling capability of neutrosophic fuzzy labeling allows it to model imprecise intensity variations of UV radiation and the wave-interference patterns fundamental to holographic reconstruction. Thus, we develop a systematic method for applying the neutrosophic fuzzy framework to network design, routing, and optimization problems, as well as to holographic encoding where labeling consistency and uncertainty coexist. In addition to providing representations of the proposed neutrosophic fuzzy labeling framework for selected graph families, the paper demonstrates that labeling constraints can yield consistent graph while managing uncertainty associated with complex physical inputs such as UV propagation and holographic wave patterns. Compared to classical graceful labeling, neutrosophic fuzzy labeling offers enhanced capability to incorporate and handle imprecise, fluctuating, and partially known data. This study lays the foundation for future theoretical refinement and future algorithm development for neutrosophic fuzzy graph labeling with respect to the graceful constraints relating to optical modeling, UV radiation analysis, and holographic systems.     

Keywords

Main Subjects

 

Article PDF

[1] C. Bujtás, S. Klavžar, and J. Tian, “Total mutual-visibility in Hamming graphs”, Opuscula Math., 45, 1 (2025). DOI: https://doi.org/10.7494/OpMath.2025.45.1.63
[2] G. Vetrivel and M. Mullai, “Vertex and edge-vertex graceful labeling on neutrosophic graphs”, TWMS J. of Apl. & Eng. Math., 15, 387 (2025). DOI: 10.33093/ijoras.2024.6.2.4
[3] G.Vetrivel and M. Mullai, “Edge graceful labeling on neutrosophic graphs”, Commun. comb.optim. 14, 387 (2024). DOI: 10.22049/cco.2024.28826.1740
[4] S. Sudha, M. Lathamaheswari, S. Broumi, and F. Smarandache,“Neutrosophic fuzzy magic labeling graphwith its Application in Academic Performance of the Students”, Nss, 60, 88 (2023). DOI: https://digitalrepository.unm.edu/nss_journal
[5] G. Vetrivel, “Neutrosophic fuzzy graceful labeling and its structural applications,” in Proc. IEEE ICCIDS, Chennai, India, 245, (2025).
[6] T. Fujita and F. Smarandache, “Uncertain labeling graphs and uncertain graph classes”, PLC , 3, 1 (2024). DOI: https://doi.org/10.61356/j.plc.2025.3464
[7] M. G. Dinorog and I. S. Cabahug Jr, “Rings domination number of some Mycielski graphs”, Asian Res. J. Math., 18, 16, (2022). DOI: 10.9734/arjom/2022/v18i127331
[8] K. L. Collins, M. E. Heenehan, and J. McDonald, “A note on the immersion number of generalized Mycielski graphs”, in Springer Proc. SEICCGTC, 235 (2021). DOI: 10.1007/978-3-030-83823-2_19
[9] H. Hameed, “On semi-transitivity of Mycielski graphs”, Discrete Appl. Math., 359, 83 (2024). DOI:  10.1016/j.dam.2023.10.021
[10] X. Huang, A. F. Ramos, and Y. Deng,“Optimal circulant graphs as low-latency network topologies”, J. Supercomput., 78, (2022). DOI: https://doi.org/10.1007/s11227-022-04396-5
[11] D. Dong, “On induced subgraphs of the Hamming graph”, J. Graph Theory., 96, 160 (2021). DOI: 10.1002/jgt.22734
[12] S. Das, B. K. Roy, M. B. Kar, S. Kar, and D. Pamučar,“Neutrosophic fuzzy set and its application in decision making”, J. Ambient Intell. Humaniz. Comput., 11, 5017, (2020). DOI: 10.1007/s12652-019-01553-0
[13] P. A. Petrosyan, H. Khachatrian, and H. Tananyan, “Interval edge-colorings of Cartesian products of graphs II”, (2024). [arXiv preprint, arXiv:2409.18088]
[14] P. Ragukumar and G. Sethuraman, “Binomial trees are graceful,” AKCE International Journal of Graphs and Combinatorics, 17, 632 (2020). DOI: 10.1016/j.akcej.2019.11.005
[15] L. D. Ningrum, N. P. Ramadhani, and F. N. Zai, “The L(2,1) labeling of windmill, binomial tree, pan, gear, prism, helm, lilly, hurdle, and key graph”, JoRMTT, 7, 78, (2025). DOI: https://doi.org/10.32734/jormtt.v7i2.2004019
[16] S. Cicerone, G. Di Stefano, and S. Klavžar, “On the mutual visibility in Cartesian products and triangle-free graphs”, Appl. Math. Comput., 438, 127619, (2023). DOI: 10.1016/j.amc.2022.127619
[17] T. Joice P. and A. Rajkumar, “Neutrosophic divisor cordial labeling graphs”, NSS, 85, 40, (2025). DOI: https://digitalrepository.unm.edu/nss_journal
[18] D. Ajay and P. Chellamani, “Fuzzy magic labeling of neutrosophic path and star graph”, Adv.Math.,Sci.J. 8, 6059, (2020). DOI: https://doi.org/10.37418/amsj.9.8.74
[19] A. P. Singh and K. Sharma, “Neutrosophic fuzzy labeling in dynamic communication networks,” in Proc. International Conference on Computational Intelligence and Communication Systems (CICS), New Delhi, India, (2022).
[20] L. Laird, R. Tillquist, S. Becker, and M. Lladser, “Resolvability of Hamming graphs”, SIAM J. Discrete Math 34, 2063 (2020). DOI: 10.1137/19M1281537
Volume 6, Issue 3
March 2026
Pages 7-19
  • Receive Date: 10 December 2025
  • Revise Date: 28 January 2026
  • Accept Date: 29 January 2026