| SmVPn的邻点可区别全色数 |
| |
| 引用本文： | 谷玉盈,李桂玲.SmVPn的邻点可区别全色数[J].山东科技大学学报(自然科学版),2006,25(1):105-106,109. |
| |
| 作者姓名： | 谷玉盈 李桂玲 |
| |
| 作者单位： | 山东科技大学信息科学与工程学院,山东青岛266510 |
| |
| 摘 要： | 设G的阶数不小于2的简单连通图。G的k-正常全染色称为是邻点可区别的，如果对G的任意相邻的两顶点，其点的颜色及关联边的颜色构成的集合不同。这样的k中最小者称为G的邻点可区别全色数。本文主要是给出了星图和路的联图的邻点可区别全色数，并提出了一猜想。
|
| 关 键 词： | 图 全染色 邻点可区别全色数 |
| 文章编号： | 1672-3767（2006）01-0105-02 |
| 收稿时间： | 2005-07-16 |
| 修稿时间： | 2005-07-16 |
Adjacent Vertex Distinguishing Total Chromatic Number on SmVPn |
| |
| GU Yu-ying, LI Gui-ling.Adjacent Vertex Distinguishing Total Chromatic Number on SmVPn[J].Journal of Shandong Univ of Sci and Technol: Nat Sci,2006,25(1):105-106,109. |
| |
| Authors: | GU Yu-ying LI Gui-ling |
| |
| Institution: | College of Info Science and Eng., SUST, Qingdao, Shandong 266510, China |
| |
| Abstract: | Let G be a simple connected graph. A-proper total coloring of is called adjacent distinguishing iffor arbitrary two adjacent vertexand,, where is the set of the colors of and the edges are adjacent to. Theminimum such that has a-adjacent-vertex-distinguishing total coloring is called the adjacent vertex distinguishing total chromatic number. The paper mainly presents the adjacent vertex distinguishing total chromatic number for the graph formed by a star and a path, and then a conjecture is raised. |
| |
| Keywords: | graph total coloring adjacent vertex distinguishing total chromatic number |
| 本文献已被 维普 等数据库收录！ |
