Injective Coloring of Double Graph of Paths and Cycles
Injective coloring of a graph is a vertex coloring in which different neighbors of each vertex are colored with the different colors,and the minimum number of colors is called injective chromatic number.The injective coloring of double graph of paths and cycles were studied,and the injective chromatic number was given in the present article.
NETL
NSTL
万方数据
