Graph homomorphisms and applications to network coding
Avinash B. Rautavinash.raut@vit.eduDepartment of Engineering Sciences and HumanitiesVishwakarma Institute of TechnologyPune, Maharashtra, 411037, IndiaView full profile → , Avinash Bansidhar Thakareabthakare2010@gmail.comDepartment of MathematicsAISSMS College of EngineeringPune, Maharashtra, 411001, IndiaView full profile → , Sudhir Tukaram Surasesudhisurase@gmail.comDepartment of MathematicsAISSMS College of EngineeringPune, Maharashtra, 411001, IndiaView full profile → , B. Kshirsagar Kirankiranksagar5555@gmail.comDepartment of MathematicsAISSMS College of EngineeringPune, Maharashtra, 411001, IndiaView full profile → , S. R. Shaikhshaziya.shaikh@pccoepune.orgDepartment of Applied Science and HumanitiesPimpri Chinchwad College of EngineeringPune, Maharashtra, 411044, IndiaView full profile → , *Machindranath B. DiwateCorresponding authordiwatemachindra@gmail.comDepartment of MathematicsSinhgad Institute of Technology and ScienceNarhe, Pune, Maharashtra, 411041, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Apr 2026
- Published Online:
- 31 Oct 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-3023
- Pages:
- 3963–3972
Abstract
Graph homomorphism have been utilized as a highly powerful mathematical tool to map the complex topologies of networks to simpler ones and still be able to retain adjacency relations. This article focuses on the use of graph homomorphism, in network coding, to increase the efficiency of data transmission, resilience and scale. The research paper proposes homomorphic mappings that are algebraic transformation that facilitate the best encoding and decoding of network nodes. The proposed methodology is founded on the synergize of graph-theoretic concepts and algebraic representation toward the realization of a better throughput, lower redundancy and higher fault tolerance. Comparative analysis has shown that the throughput has increased by up to 18.6 and the decrease in the traditional routing schemes by up to 22.3 in the number of packets lost. The novelty is to plot the structural graphs in a cohesive way with the strategies of coding to allocate the data effectively. The architecture can be used in distributed systems, wireless networks, and IoT networks and provides a secure and scalable communication service.
Keywords
Subject Classifications
References
[1] M. Zhao, H. Wang, and B. Yao, “Graphic groups, graph homomorphisms, and graphic group lattices in asymmetric topology cryptography,” Entropy, vol. 25, no. 5, Art. no. 720 (2023), doi: 10.3390/e25050720.
[2] G. Peralta, R. G. Cid-Fuentes, J. Bilbao, and P. M. Crespo, “Homomorphic encryption and network coding in IoT architectures: Advantages and future challenges,” Electronics, vol. 8, no. 8, Art. no. 827 (2019), doi: 10.3390/electronics8080827.
[3] M. Alqahtani, M. Kaviyarasu, A. Al-Masarwah, and M. Rajeshwari, “Application of complex neutrosophic graphs in hospital infrastructure design,” Mathematics, vol. 12, no. 5, Art. no. 719 (2024), doi: 10.3390/math12050719.
[4] S. Wang, X. Su, B. Zhao, P. Hu, T. Bai, and L. Hu, “An improved graph isomorphism network for accurate prediction of drug–drug interactions,” Mathematics, vol. 11, no. 18, Art. no. 3990 (2023), doi: 10.3390/math11183990.
[5] A. Farzaneh, J. P. Coon, and M.-A. Badiu, “Kolmogorov basic graphs and their application in network complexity analysis,” Entropy, vol. 23, no. 12, Art. no. 1604 (2021), doi: 10.3390/e23121604.
[6] R. C. Poonia, T. Singh, C. K. Rajashri, D. Mondal, and S. M. Patil, “Optimizing communication system security through comprehensive testing and intelligent network configurations,” J. Inf. Optim. Sci., vol. 47, no. 5-A, pp. 1709–1717 (2026), doi: 10.47974/JIOS-2261.
[7] S. A. U. H. Bokhary, A. Kharal, F. M. A. Samman, M. E. E. Dalam, and A. Gargouri, “Efficient graph algorithms in securing communication networks,” Symmetry, vol. 16, no. 10, Art. no. 1269 (2024), doi: 10.3390/sym16101269.
[8] S. Wazzan and D. A. Oluyori, “Graph-theoretic idealization of semigroups via Bruck-Reilly extensions,” Mathematics, vol. 14, no. 5, Art. no. 891 (2026), doi: 10.3390/math14050891.
[9] A. Majeed and I. Rauf, “Graph theory: A comprehensive survey about graph theory applications in computer science and social networks,” Inventions, vol. 5, no. 1, Art. no. 10 (2020), doi: 10.3390/inventions5010010.
[10] V. Jude Annie Cynthia and E. Padmavathy, “On directed signed cordial labeling,” J. Inf. Optim. Sci., vol. 47, no. 4, pp. 1335–1343 (2026), doi: 10.47974/JIOS-2173.
[11] G. Jayabalasamy, C. Pujol, and K. Latha Bhaskaran, “Application of graph theory for blockchain technologies,” Mathematics, vol. 12, no. 8, Art. no. 1133 (2024), doi: 10.3390/math12081133.
[12] M. R. Tiwari and S. S. Patil, “Deep-fake image detection using machine learning techniques: A comprehensive review,” IJAECE, vol. 15, no. 1S, pp. 137–145 (Jan. 2026).
[13] M. Hayashi, “Secure physical layer network coding versus secure network coding,” Entropy, vol. 24, no. 1, Art. no. 47 (2022), doi: 10.3390/e24010047.
