首页 | 本学科首页   官方微博 | 高级检索  
     检索      

若干倍图的均匀全染色(英文)
引用本文:马刚,马明,张忠辅.若干倍图的均匀全染色(英文)[J].数学研究,2009,42(1).
作者姓名:马刚  马明  张忠辅
作者单位:1. 西北民族大学计算机科学与信息工程学院,甘肃,兰州,730030
2. 兰州交通大学应用数学研究所,甘肃,兰州,730070
基金项目:Youth Science Foundation of Northwest University for Nationalities,National Nationalities Comm/ssion Science Foundation of China,国家自然科学基金 
摘    要:如果图G的一个正常全染色满足任意两种颜色所染元素(点或边)数目相差不超过1,则称为G的均匀全染色,其所用最少染色数称为均匀全色数.本文得到了星、扇和轮的倍图的均匀全色数.

关 键 词:倍图  均匀全染色  均匀全色数

On the Equitable Total Coloring of Double Graph of Some Graphs
Ma Gang,Ma Ming,Zhang Zhongfu.On the Equitable Total Coloring of Double Graph of Some Graphs[J].Journal of Mathematical Study,2009,42(1).
Authors:Ma Gang  Ma Ming  Zhang Zhongfu
Institution:1.College of Computer and Information; Northwest University for Nationalities; Lanzhou Gansu 730030; 2.Institute of Applied Mathematics; Lanzhou JiaoTong University; Lanzhou Gansu 730070 );
Abstract:A proper total-coloring of graph G is said to be equitable if the number of elements (vertices and edges) in any two color classes differ by at most one, which the required minimum number of colors is called the equitable total chromatic number. In this paper, we derive the equitable total chromatic numbers of double graphs of star, fan and wheel.
Keywords:double graph  equitable total coloring  equitable total chromatic number
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号