Finding secure communication channels via rainbow antimagic coloring of m-splitting graphs of paths

[EN] Rainbow graph coloring constitutes a useful tool to strengthen conventional connectivity and ensure secure transmission of classified information among the nodes of a communication network. This infomation flows in a secure way via rainbow paths, where colors represent distinct firewalls that prevent intruder attacks. Computing the so-called rainbow connection number enables one to optimize the related protocol by minimizing the number of these firewalls. This paper delves into this topic by dealing with the rainbow graph coloring of m-splitting graphs of paths. Based on the creation of duplicated phantom nodes, this family of graphs allows the creation of new firewalls and secure communication channels among the original nodes