关于双图的群染色
On the Group Coloring of some double Graphs
对于在一定方向D下的简单图G和阿贝尔群A，F(G,A)是指所有从E(G)到A映射的集合，如果任意的f属于F(G,A)都存在从V(G)到A的映射c使得G中任一有向边uv(从u指向v)c(u)-c(v)不等于f(uv),那么我们就说G是A-可染的。能使得图G是A-可染的A的最小基数叫群色数。本文主要讨论了一些双图的群色数。
LetG be a graph and A an Abelian group .Denote F(G,A)by the set of all functions from E(G) to A.DenoteDby an orientation ofG.For any fin F(G,A), the function c is from V(G) to A such that for every directed edge uv from u to v ,c(u)-c(v) not equal to f(uv),we say G is A-colrable. The group chromatic number of a graph is the minimum number m such thatG is A-colrable for any Abelian group of order under the orientation D. In this paper, we obtain the group chromatic number of some double graphs.
杨星星
数学
群染色群色数双图
group coloringgroup chromatic numberdouble graphs
杨星星.关于双图的群染色[EB/OL].(2009-04-01)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/200904-20.点此复制
评论