arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2206.04822math.CO
收藏

论图的和谐色数

On the harmonious chromatic number of graphs

Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen, Christian Rubio-Montiel

AI总结:

本文研究图的和谐色数,围绕图同态、有限线性系统的关联图及若干循环图给出多种相关结果。

摘要:

图 $G$ 的和谐色数,是指能够以正常方式分配给 $G$ 的顶点,并使任意两条不同边具有不同颜色对的最少颜色数。本文给出了与同态、有限线性系统的关联图以及某些循环图有关的和谐色数的多种结果。

英文摘要:

The harmonious chromatic number of a graph $G$ is the minimum number of colors that can be assigned to the vertices of $G$ in a proper way such that any two distinct edges have different color pairs. This paper gives various results on harmonious chromatic number related to homomorphisms, incidence graphs of finite linear systems, and some circulant graphs.

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

↑