欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
图的全染色概念是点染色和边染色的推广，图的所有元素（顶点和边）都将染色且任相邻或关联的元素染色不同．邻点可区分的全染色是在正常全染色的定义上，使得相邻顶点的色集（C（v））不同．本文给出了P^n，Sn及其构造：Hajós sum，部分点替换图的邻点可区别的相邻顶点可区分的全染色．
英文摘要：
The total coloring is a generalization of the dot and edge coloring, and all of the elements （vertices and edges）of a graph are colored in such a way that no two adjacent or incident elements are colored identically. The adjacent vertex-distinguish total coloring is a total colors and the colors sets of two adjacent vertices are different.The adjacent vertex-distinguishing total coloring numbers of graph P^n, Sn, their Hajós sum and part of the substituted graphs of vertices are given in this paper.
同期刊论文项目
同项目期刊论文
期刊信息
位置：