若干笛卡尔积图的邻点可区别关联染色

Adjacent Vertex Distinguishing Incidence Coloring of the Cartesian Product of Some Graphs

中文关键词:  积图  关联染色  邻点可区别关联染色  邻点可区别关联色数.

英文关键词:Cartesian product  incidence coloring  adjacent vertex distinguishing incidence coloring  adjacent vertex distinguishing incidence chromatic number.

中文摘要:

      图$G$的邻点可区别关联染色是指$G$的任意一对相邻顶点色集不同的关联染色. 我们得到了 路与路、 路与星、 路与轮以及路与扇的笛卡尔积图的邻点可区别关联色数.

英文摘要:

      An adjacent vertex distinguishing incidence coloring of graph $G$ is an incidence coloring of $G$ such that no pair of adjacent vertices meets the same set of colors. We obtain the adjacent vertex distinguishing incidence chromatic number of the Cartesian product of a path and a path, a path and a wheel, a path and a fan, and a path and a star.