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

关于块图的Hamilton染色

On hamiltonian colorings of block graphs

Devsi Bantva

摘要:

p阶图G的一个哈密尔顿染色c是G的顶点的颜色分配,使得对于G的每两个不同的顶点u和v,有$D(u,v)+|c(u)-c(v)|\geq p-1$,其中D(u,v)表示u和v之间的迂回距离.图G的Hamilton色数记为hc(G),是G的所有Hamilton染色c上取的min{hc(c)}.本文提出了块图的Hamilton色数的一个下界,并给出了达到该下界的一个充分条件。我们刻画对称块图达到这个下界。提出了对称块图最优哈密尔顿染色的两个算法。

英文摘要:

A hamiltonian coloring c of a graph G of order p is an assignment of colors to the vertices of G such that $D(u,v)+|c(u)-c(v)|\geq p-1$ for every two distinct vertices u and v of G, where D(u,v) denoted the detour distance between u and v. The value hc(c) of a hamiltonian coloring c is the maximum color assigned to a vertex of G. The hamiltonian chromatic number, denoted by hc(G), is the min{hc(c)} taken over all hamiltonian coloring c of G. In this paper, we present a lower bound for the hamiltonian chromatic number of block graphs and give a sufficient condition to achieve the lower bound. We characterize symmetric block graphs achieving this lower bound. We present two algorithms for optimal hamiltonian coloring of symmetric block graphs.

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

↑