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

最优$k$排序中边数的最大化

Maximizing the number of edges in optimal $k$-rankings

Rigoberto Florez, Darren A. Narayan

摘要:

$k$ -排序是顶点$k$ -着色,使得如果两个顶点具有相同的颜色,则连接它们的任何路径包含较大颜色的顶点。图的秩数是最小的$k$,使得$G$具有$k$ -秩。对于某些图$G$,我们考虑可以添加到$G$而不改变秩数的边的最大数目。在这里,我们调查的问题$G=P_{2^{k-1}}$,$C_{2^{k}}$,$K_{m_{1},m_{2},\dots,m_{t}}$,并通过一个单一的边缘连接的两个副本的$K_{n}$的工会。除了确定可以添加到$G$而不改变秩数的边的最大数量之外,我们还提供了当添加到$G$时哪些边改变秩数以及哪些边不改变秩数的明确表征。

英文摘要:

A $k$-ranking is a vertex $k$-coloring such that if two vertices have the same color any path connecting them contains a vertex of larger color. The rank number of a graph is smallest $k$ such that $G$ has a $k$-ranking. For certain graphs $G$ we consider the maximum number of edges that may be added to $G$ without changing the rank number. Here we investigate the problem for $G=P_{2^{k-1}}$, $C_{2^{k}}$, $K_{m_{1},m_{2},\dots,m_{t}}$, and the union of two copies of $K_{n}$ joined by a single edge. In addition to determining the maximum number of edges that may be added to $G$ without changing the rank number we provide an explicit characterization of which edges change the rank number when added to $G$, and which edges do not.

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

↑