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

图的灰度级

Gradation in Greyscales of Graphs

Natalia de Castro, María A. Garrido-Vizuete, Rafael Robles, María Trinidad Villar-Liñán

摘要:

在这项工作中,我们提出了一个图的灰度的概念,作为其顶点的着色,使用的颜色从真正的区间[0,1]。任何灰度都通过将其顶点颜色之间的非负差异分配给每个边来诱导另一种颜色。这些边缘颜色按字典序递减顺序排列,并产生一个新的图形元素:灰度向量。我们引入了最小灰度向量的概念作为图的一个新的不变量,并给出了求最小灰度向量的多项式算法,这些算法还输出产生最小灰度向量的所有灰度。通过这种方式,我们处理并解决了一个新的矢量最优化问题的图形,可以产生更令人满意的解决方案比已知的标量优化方法产生的。这些新概念的兴趣在于它们可能用于解决工程、物理和应用数学问题,这些问题是根据网络建模的,该网络的节点具有由实数范围限定的特定参数的指定数值。目标是最小化每个节点与其邻居之间的差异,确保分配间隔的极值。

英文摘要:

In this work we present the notion of greyscale of a graph as a colouring of its vertices that uses colours from the real interval [0,1]. Any greyscale induces another colouring by assigning to each edge the non-negative difference between the colours of its vertices. These edge colours are ordered in lexicographical decreasing ordering and gives rise to a new element of the graph: the gradation vector. We introduce the notion of minimum gradation vector as a new invariant for the graph and give polynomial algorithms to obtain it. These algorithms also output all greyscales that produce the minimum gradation vector. This way we tackle and solve a novel vectorial optimization problem in graphs that may produce more satisfactory solutions than those ones generated by known scalar optimization approaches. The interest of these new concepts lies in their possible applications for solving problems of engineering, physics and applied mathematics which are modeled according to a network whose nodes have assigned numerical values of a certain parameter delimited by a range of real numbers. The objective is to minimize the differences between each node and its neighbors, ensuring that the extreme values of the interval are assigned.

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

↑