图的injective k-色数的一些上界

he injective k-coloring of a graph G is an assignment of k colours to the vertices of G such that two vertices share the same neigbhbour must have distinct colours. The injective chromatic number of a graph G is the minimum k such that G has an injective k-coloring . In this paper, we give some upper bounds on the injective chromatic number of graphs.