r-gd Chromatic Number of Graphs
摘要
This paper introduces a new graph parameter that combines the concepts of the geodetic number and the r-dynamic chromatic number. The proposed parameter captures both the geodesic structure of a graph and the constraints imposed by r-dynamic coloring. Fundamental properties of this newly defined invariant are established and general bounds in terms of standard graph parameters are derived. Further, Several families of tree graphs are examined, for which exact values are obtained. These results illustrate the interaction between geodetic properties and r-dynamic coloring and provide a useful framework for further research in this area.