arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1205.2572math.CO
收藏

图的群和色数

Group Sum Chromatic Number of Graphs

Marcin Anholcer, Sylwia Cichacz

摘要:

本文研究图的\textit{group sum chromatic number}($\gchi(G)$),即最小值$s$,使得取任意阶$s$的阿贝尔群$\gr$,存在函数$f:E(G)\rightarrow \gr$,使得边标号和适当地着色顶点.已知对于任何不含阶数小于$3$的分支的图$G$,都有$\gchi(G)\in\{χ(G),χ(G)+1\}$,并且我们刻画了有$\gchi(G)=χ(G)$的图.

英文摘要:

We investigate the \textit{group sum chromatic number} ($\gchi(G)$) of graphs, i.e. the smallest value $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge labels properly colour the vertices. It is known that $\gchi(G)\in\{χ(G),χ(G)+1\}$ for any graph $G$ with no component of order less than $3$ and we characterize the graphs for which $\gchi(G)=χ(G)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑