arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1711.05091cs.DMmath.CO
收藏

完全二部图的半径序列$k$

Sequences of radius $k$ for complete bipartite graphs

Michał Dębski, Zbigniew Lonc, Paweł Rzążewski

摘要:

图$G$的\emph{$k$-radius sequence}是$G$的顶点序列(通常具有重复),使得对于$G$的每条边$uv$,顶点$u$和$v$在序列中的距离$k$内至少出现一次。$G$的最短$k$ -半径序列的长度由$f_k(G)$表示.我们给出了完全二部图的$f_k(G)$的一个渐近紧估计{它匹配一个下界,对所有二部图都有效}。我们还表明,确定$f_k(G)$的任意图$G$是NP-困难的每个常数$k>1$。

英文摘要:

A \emph{$k$-radius sequence} for a graph $G$ is a sequence of vertices of $G$ (typically with repetitions) such that for every edge $uv$ of $G$ vertices $u$ and $v$ appear at least once within distance $k$ in the sequence. The length of a shortest $k$-radius sequence for $G$ is denoted by $f_k(G)$. We give an asymptotically tight estimation on $f_k(G)$ for complete bipartite graphs {which matches a lower bound, valid for all bipartite graphs}. We also show that determining $f_k(G)$ for an arbitrary graph $G$ is NP-hard for every constant $k>1$.

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

↑