图的邻点强可区别的EI-全染色

J4 ›› 2010, Vol. 45 ›› Issue (6): 18-22.

图的邻点强可区别的EI-全染色

程辉,王志勇

西北师范大学数学与信息科学学院，甘肃兰州 730070

收稿日期:2009-09-14 出版日期:2010-06-16 发布日期:2010-06-17
作者简介:程辉 (1953-),女,教授,主要研究方向为图论. Email:chenghuinwnu@163. com 王志勇 (1985-),男,硕士.主要研究方向为图论.Email: wangzy246@163. com
基金资助:
国家自然科学基金资助项目(10771091)

The adjacent vertex strongly distinguishing EI-total colorings of graphs

CHENG Hui, WANG Zhi-yong

College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, Gansu, China

Received:2009-09-14 Online:2010-06-16 Published:2010-06-17

摘要/Abstract

摘要：

提出了图的邻点强可区别的EI-全染色的概念,研究了它的一些性质，得到了路,扇,轮,圈,完全二部图,完全图,树,Petersen图的邻点强可区别的EI-全色数。

关键词: 邻点可区别全染色; 邻点强可区别的全染色; 邻点强可区别的EI-全染色

Abstract:

The concept of adjacent vertex strongly distinguishing EI-total coloring of graph is proposed. Some properties and the adjacent vertex strongly distinguishing EI-total chromatic numbers of some graphs, such as Path, Fan, Wheel, Cycle, Complete bipartite graph, Complete graph,Tree, Petersen graph, are investigated.

Key words: adjacent vertex distinguishing total coloring; adjacent vertex strongly distinguishing total coloring; adjacent vertex strongly distinguishing EI-total coloring

程辉,王志勇. 图的邻点强可区别的EI-全染色[J]. J4, 2010, 45(6): 18-22.

CHENG Hui, WANG Zhi-yong. The adjacent vertex strongly distinguishing EI-total colorings of graphs[J]. J4, 2010, 45(6): 18-22.

参考文献

多维度评价

Viewed

Full text

311

HTML			PDF

Just accepted	Online first	Issue	Just accepted	Online first	Issue
0	0	0	0	0	311

From	Others	local

Times	10	301
Rate	3%	97%

Abstract

783

Just accepted	Online first	Issue

0	0	783

	From	Others

	Times	783
	Rate	100%

Cited

Web of Science	Crossref	ScienceDirect	Search for Citations in Google Scholar >>


This page requires you have already subscribed to WoS.

Shared

Discussed