重庆工商大学学报（自然科学版）

引用本文:	胡凤凤1，刘家保2.关于一类图的邻点可区别全染色(J/M/D/N,J:杂志，M：书，D：论文，N：报纸).期刊名称,2015，32（2）：23-26
	CHEN X. Adap tive slidingmode contr ol for discrete2ti me multi2inputmulti2 out put systems[ J ]. Aut omatica, 2006, 42(6): 4272-435

【打印本页】【下载PDF全文】【查看/发表评论】【EndNote】【RefMan】【BibTex】

←前一篇|后一篇→

过刊浏览高级检索

本文已被：浏览 871次下载 1975次	码上扫一扫！
分享到：微信更多字体:加大+\|默认\|缩小-
关于一类图的邻点可区别全染色
胡凤凤1，刘家保2^1,2
1.安徽大学数学科学学院，合肥 230601;2.安徽新华学院公共课教学部，合肥 230088）

摘要:

图G的一个正常全染色f称为是邻点可区别的, 如果G中任何相邻点及其关联边的颜色集合不同;对一个图G进行邻点可区别的正常全染色所用最少颜色数称为G的邻点可区别全色数, 记为 χat(G)；给出了一类特殊图类的邻点可区别全色数.

关键词: 正常全染色邻点可区别全染色邻点可区别全色数

DOI：

分类号:

基金项目:

On Adjacent Vertex Distinguishing Total Coloring for a Class of Graphs

HU Feng feng1, LIU Jia bao2

Abstract:

A normal total coloring f of graph G is adjacent vertex distinguishing. If any point of an adjacent vertex in G and the color set of its related edges are different, the smallest number of colors used in the normal adjacent vertex distinguishing total coloring for a Graph G is called the number of adjacent vertex distinguishing total coloring and is denoted as Xat (G). This paper gives a class of special adjacent vertex distinguishing total coloring number of graphs.

Key words: normal total coloring adjacent vertex distinguishing total coloring adjacent vertex distinguishing total coloring number