Incidence Coloring Number of Some Join Graphs

The incidence coloring of a graph is a mapping from its incidence set to color set in which neighborly incidences are assigned different colors. In this paper, we determined the incidence coloring numbers of some join graphs with paths and paths, cycles, complete graphs, complete bipartite graphs, respectively, and the incidence coloring numbers of some join graphs with complete bipartite graphs and cycles, complete graphs, respectively.