图的灰度对比度
Contrast in Greyscales of Graphs
摘要:
图$G(V,E)$的灰度$f$是从$V$到区间$[0,1]$的映射,使得$\{0, 1\} \subseteq Im(f)$。该函数$f$通过将其顶点上的$f$的值的非负差分配给每个边,从而在$E$上导出另一个映射$\widehat{f}$。对比度矢量$cont(G,f)$被定义为用于$G$的所有边缘$e_i$的矢量$(\widehat{f}(e_1), \widehat{f}(e_2), \ldots, \widehat{f}(e_m))$,使得$i= 1, 2, \dots, m-1$的$\widehat{f}(e_i) \leq \widehat{f}(e_{i+1})$。利用$G$上定义的所有可能灰度的对比度向量的字典序,提出了最大对比度向量的概念,并将产生最大对比度向量的灰度称为最大对比度灰度。建立了图$G$的最大对比度向量与图$G$的色数之间的关系。因此,最大对比度问题是一个NP完全问题。然而,任何图的任何最大对比度灰度的值的集合由给定的有限集合限定。本文总结了几种计算最大对比度矢量的方法,并给出了一些限制条件。
英文摘要:
A greyscale $f$ of a graph $G(V,E)$ is a mapping from $V$ to the interval $[0,1]$ such that $\{0, 1\} \subseteq Im(f)$. This function $f$ induces another mapping $\widehat{f}$ on $E$ by assigning to each edge the non-negative difference of the values of $f$ on its vertices. The contrast vector $cont(G,f)$ is defined as the vector $(\widehat{f}(e_1), \widehat{f}(e_2), \ldots, \widehat{f}(e_m))$ for all edges $e_i$ of $G$ in such a way that $\widehat{f}(e_i) \leq \widehat{f}(e_{i+1})$ for $i= 1, 2, \dots, m-1$. The concept of maximum contrast vector is presented by using the lexicographical ordering in the set of contrast vectors of all possible greyscales defined on $G$ and a greyscale that gives rise to a maximum contrast vector is named maximum contrast greyscale. The relation between finding the maximum contrast vector for the graph $G$ and the chromatic number of $G$ is established. Thus the maximum contrast problem is an NP-complete problem. However, the set of values of any maximum contrast greyscale for any graph is bounded by a finite set which is given. Several methods to compute the maximum contrast vector with some restrictions in are collected in this paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。