arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1106.3453math.CO
收藏

关于图的笛卡儿积的定位色数

On the Locating Chromatic Number of the Cartesian Product of Graphs

Ali Behtoei, Behnaz Omoomi

摘要:

设$c$是连通图$G$的一个真$k$ -着色,$Π=(C_1,C_2,...,C_k)$是$V(G)$到结果色类的有序划分.对于$G$的顶点$v$,$v$相对于$Π$的颜色代码被定义为有序$k$ -元组$c_{{}_Π}(v):=(d(v,C_1),d(v,C_2),...,d(v,C_k)),$,其中$d(v,C_i)=\min\{d(v,x) | x\in C_i\}, 1\leq i\leq k$。如果不同的顶点具有不同的颜色代码,则$c$称为定位着色。$G$的定位着色中所需的最小颜色数是$G$的定位色数,用$\Cchi_{{}_L}(G)$表示。本文研究了格的定位色数、路与完全图的笛卡儿积以及两个完全图的笛卡儿积。

英文摘要:

Let $c$ be a proper $k$-coloring of a connected graph $G$ and $Π=(C_1,C_2,...,C_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Π$ is defined to be the ordered $k$-tuple $c_{{}_Π}(v):=(d(v,C_1),d(v,C_2),...,d(v,C_k)),$ where $d(v,C_i)=\min\{d(v,x) | x\in C_i\}, 1\leq i\leq k$. If distinct vertices have distinct color codes, then $c$ is called a locating coloring. The minimum number of colors needed in a locating coloring of $G$ is the locating chromatic number of $G$, denoted by $\Cchi_{{}_L}(G)$. In this paper, we study the locating chromatic number of grids, the cartesian product of paths and complete graphs, and the cartesian product of two complete graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑