Injective Colorings of Wheel Related Graph Families
An injective vertex coloring of G is a coloring of the vertices of G so that any two vertices with a common neighbor receive distinct colors. The smallest integer k such that a graph G admits an injective vertex colorings with k colors is known as the injective chromatic number χi(G) of G. In this paper, we investigate the injective vertex colorings of some Wheel related graph.