陈祥恩,张忠辅,孙宜蓉.图$P_m\times P_n, P_m\times C_n$ 和C_m\times C_n$}的邻点可区别全色数的注记[J].数学研究及应用,2008,28(4):789~798 |
图$P_m\times P_n, P_m\times C_n$ 和C_m\times C_n$}的邻点可区别全色数的注记 |
A Note on Adjacent-Vertex-Distinguishing Total Chromatic Numbers for $P_m\times P_n, P_m\times C_n$ and $C_m\times C_n$ |
投稿时间:2006-09-12 修订日期:2007-10-28 |
DOI:10.3770/j.issn:1000-341X.2008.04.006 |
中文关键词: 图 全染色 邻点可区别全染色 邻点可区别全色数. |
英文关键词:total coloring adjacent-vertex-distinguishing total coloring adjacent-vertex-distinguishing total chromatic number. |
基金项目:国家自然科学基金(No.10771091); 甘肃省教育厅科研项目(No.0501-02). |
|
摘要点击次数: 8353 |
全文下载次数: 2168 |
中文摘要: |
设 $G$ 是一个简单图. 设$f$是从$V(G) \cup E(G)$到 $\{1, 2,\ldots, k\}$的一个映射.对任意的 $v\in V(G)$, 设$C_f(v)=\{f(v)\}\cup \{f (vw)|w\in V(G),vw\in E(G)\}$ . 如果 $f$ 是一个 $k$-正常全染色, 且对 $u, v\in V(G),uv\in E(G)$, 有 $C_f(u)\neq C_f(v)$, 那么称 $f$ 为$k$-邻点可区别全染色 (简记为$k$-$AVDTC$). 设 |
英文摘要: |
Let $G$ be a simple graph. Let $f$ be a mapping from $V(G) \cup E(G)$ to $\{1, 2,\ldots, k\}$. Let $C_f(v)=\{f(v)\}\cup \{f (vw)|w\in V(G), vw\in E(G)\}$ for every $v\in V(G)$. If $f$ is a $k$-proper-total-coloring, and for $u, v\in V(G), uv\in E(G)$, we have $C_f(u)\neq C_f(v)$, then $f$ is called a $k$-adjacent-vertex-distinguishing total coloring ($k$-$AVDTC$ for short). Let $\chi_{at} (G)= \min\{k|G$ have a $k$-adjacent-vertex-distinguishing total coloring$\}$. Then $\chi_{at} (G)$ is called the adjacent-vertex-distinguishing total chromatic number ($AVDTC$ number for short). The $AVDTC$ numbers for $P_m\times P_n, P_m\times C_n$ and $C_m\times C_n$ are obtained in this paper. |
查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|