Secure communication via c-exponential mean-labeled graphs : A novel message encryption scheme

Madhumitha, K. V.; Rao, Anuradha; Prabhu, T. Prajwal; Nayak, Swati; D’Souza, Sabitha

doi:10.47974/JDMSC-2653

Open Access Research Article

Secure communication via c-exponential mean-labeled graphs : A novel message encryption scheme

K. V. Madhumithamadhumithakv467@gmail.comManipal Institute of Technology Manipal Academy of Higher EducationManipal, Karnataka, 576104, IndiaView full profile → , Anuradha Raoanuradha.rao@manipal.eduManipal Institute of Technology Manipal Academy of Higher EducationManipal, Karnataka, 576104, IndiaView full profile → , T. Prajwal Prabhuprajwalprabhu.tellar@gmail.comManipal Institute of Technology Manipal Academy of Higher EducationManipal, Karnataka, 576104, IndiaView full profile → , Swati Nayakswati.nayak@manipal.eduManipal Institute of Technology Manipal Academy of Higher EducationManipal, Karnataka, 576104, IndiaView full profile → , ^*Sabitha D’SouzaCorresponding authorsabitha.dsouza@manipal.eduManipal Institute of Technology Manipal Academy of Higher EducationManipal, Karnataka, 576104, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 2393–2408Vol. 29Issue 6June 2026DOI: 10.47974/JDMSC-2653 Crossmark XML

Received:: 01 Aug 2025
Published Online:: 16 Jun 2026
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2653
Pages:: 2393–2408

Abstract

Cryptography plays an important role in transferring information safely in the computerized world. It consists of two parts; one is encryption of the message so that the cipher text will not reveal the original message to anyone. The other part is decryption at the receiver’s side which reverses the encryption process and restores the original message. There is numerous encryption algorithm to secure the information. Graph labeling is one of the tools to encrypt a message. This paper proposes a new encryption technique to encode and decode the message very securely using C-exponential mean graph labeling by considering various graphs.

Keywords

Encryption Decryption Graph labeling C-exponential mean labelling Secure communication

Subject Classifications

94A6005C7805C90

References

[1] J. Katz and Y. Lindell, Introduction to modern cryptography: principles and protocols., Chapman and hall/CRC. (2007).
[2] D. B. West, Introduction to graph theory (Vol. 2, pp. 1-512)., Upper Saddle River: Prentice hall. (2001).
[3] A. Rosa, “On certain valuations of the vertices of a graph.,” in In Theory of Graphs (Internat. Symposium, Rome (pp. 349-355)., Rome (1966).
[4] S. Somasundaram and R. Ponraj, “Mean labelings of graphs.,” National academy Science letters, vol. 26, no. 7, pp. 210-213 (2003).
[5] J. A. Gallian, “A dynamic survey of graph labeling,” Electronic Journal of Combinatorics, p. DS6 (2018).
[6] Medini, H. R., Sabitha D’Souza, C. Devadas Nayak, and Pradeep G. Bhat. “Exploring secure communication through artistic graph creation.,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 28, no. 1, pp. 143-159 (2025).
[7] K. Meera and S. Baskar, “Key Generation in Cryptography Using Radio Path Coloring,” IEEE Access, vol. 12, pp. 60475-60481 (2024).
[8] A. Meenakshi, A. Kannan, R. Cep, and M. Elangovan, “Efficient graph network using total magic labeling and its applications,” Mathematics, vol. 11, no. 19, p. 4132 (2023).
[9] D. X. Charles, K. E. Lauter, and E. Z. Goren. “Cryptographic hash functions from expander graphs,” Journal of Cryptology, vol. 22, no. 1, pp. 93-113 (2009).
[10] Y. Rajput, D. Naik, and C. Mane. “An improved cryptographic technique to encrypt text using double encryption,” International Journal of Computer Applications, vol. 86, no. 6, pp. 24-28 (2014).
[11] A. B. Srinivasan and S. Hemalatha. “A table-based end to end encryption technique without key exchange,” Engineered Science, vol. 19, pp. 279-284 (2022).
[12] C. Beaula, P. Venugopal, and B. Praba. “Block encryption and decryption of a sentence using decomposition of the Turan graph,” Journal of Mathematics, vol. 2023, no. 1, p. 7588535 (2023).
[13] A. Krishnaa, “Inner magic and inner antimagic graphs in cryptography,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 22, no. 6, pp. 1057-1066 (2019).
[14] P. L. K. Priyadarsini. “A survey on some applications of graph theory in cryptography,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 18, no. 3, pp. 209-217 (2015).
[15] G. Zémor, “Hash functions and Cayley graphs,” Designs, Codes and Cryptography, vol. 4, no. 3, pp. 381-394 (1994).
[16] B. Ni, R. Qazi, S. U. Rehman, and G. Farid. “ Some Graph-Based Encryption Schemes,” Journal of Mathematics, vol. 1, no. 6614172, p. 2021 (2021).
[17] A. R. Kannan, R. R. Jeyalakshmi, P. Manivannan, and A. D. Baskar. “Exponential meanness of some ladder related graphs,” InJournal of Physics: Conference Series, vol. 1, no. 012034, p. 1597 (2020).
[18] K. M. Nagaraja, S. Ramachandraiah, and V. B. Siddappa. “Power exponential mean labeling of graphs,” Montes Taurus Journal of Pure and Applied Mathematics, vol. 3, no. 2, pp. 70-79 (2021).
[19] T. Baskaran and R. Ganapathy. “A Study on C-Exponential Mean Labeling of Graphs,” Journal of Mathematics, vol. 2022, no. 1, p. 2865573 (2022).

Views: 51Downloads: 15Citations: 0