若干合成图的星全染色 |
| |
引用本文: | 王晓琦,田双亮.若干合成图的星全染色[J].武汉水运工程学院学报,2012(5):1098-1100. |
| |
作者姓名: | 王晓琦 田双亮 |
| |
作者单位: | 西北民族大学数学与计算机科学学院,兰州730030 |
| |
基金项目: | ’国家民委科研项目资助(批准号:IOXB01) |
| |
摘 要: | 简单图G和H的合成图是指具有顶点集V(G)×V(H)的简单图GH],它的顶点(u,v)和另一个顶点(u,v')相邻当且仅当或者uu'∈E(G),或者“u=u’且vv’∈E(H).文中研究了n+1阶简单图G与m阶简单图H的合成图的星全染色,其中G为Wn。,扇Fm或星Sn.得到以下结果:(1)若△(H)=2且n≥4,m≥5,则GH]的星全色数为(2n+1)m;(2)若x(H)=△(H)=m-1且n,m≥4,则GH]的星全色数为2(n+1)m-1.
|
关 键 词: | 合成图 星全染色 星全色数 |
Star Total Colorings of Some Composition Graphs |
| |
Authors: | WANG Xiaoqi TIAN Shuangliang |
| |
Institution: | (College of Mathematics and Computer Science, Northwest University for Nationalities, Lanzhou 730030,China) |
| |
Abstract: | The composition of simple graphs G and H is the simple graph GH] with vertex set V(G) X V(H), in which (u,~) is adjacent to (u' ,v') if and only if either uu' 6: E(G) or u=u' and vv' 6: E(H). The paper focused on the star total coloring of the composition of a simple graph G with n+1 vertices and a simple graph H with m vertices, where O is a wheel, fan, or star. And the following results are obtained: (1) if △(H)=2 and n≤4,m≥5, then the star total chromatic number of graph GH] is (2n+1)m; (2) if X (H)=A(H)=m-1, and n,m≥4, then the star total chromatic number of graph GH] is 2(n+1)m-1. Key words:composition graph; star total coloring; star total chromatic number |
| |
Keywords: | composition graph star total coloring star total chromatic number |
本文献已被 维普 等数据库收录! |
|