For a given graph G = (V (G), E(G)), researchers have introduced different colorings based on the distances of the vertices. An injective coloring of a graph G is an assignment of colors to the vertices of G such that no ...