arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.12018cs.CC
收藏

关于k-度量维数复杂性的一个注记

A note on the complexity of k-Metric Dimension

Yannick Schmitz, Duygu Vietz, Egon Wanke

摘要:

无向连通图$G=(V,E)$的两个顶点$u, v \in V$可由一个顶点$w$分解,如果$u$与$w$之间的距离和$v$与$w$之间的距离不同.顶点集合$R \subseteq V$是$G$的$k$ -解析集合,如果对于每对顶点$u, v \in V$,至少存在$k$不同的顶点$w_1,\ldots,w_k \in R$,使得它们中的每一个解析$u$和$v$。$G$的$k$ -度量维数是$G$的最小$k$ -解析集的大小。判定问题$k$ -度量维数是指对于给定的图$G$和给定的数$r$,G是否有一个大小至多为$r$的$k$ -可分解集.本文证明了二部图和每个$k \geq 2$的$k$ -度量维数的NP-完全性。

英文摘要:

Two vertices $u, v \in V$ of an undirected connected graph $G=(V,E)$ are resolved by a vertex $w$ if the distance between $u$ and $w$ and the distance between $v$ and $w$ are different. A set $R \subseteq V$ of vertices is a $k$-resolving set for $G$ if for each pair of vertices $u, v \in V$ there are at least $k$ distinct vertices $w_1,\ldots,w_k \in R$ such that each of them resolves $u$ and $v$. The $k$-Metric Dimension of $G$ is the size of a smallest $k$-resolving set for $G$. The decision problem $k$-Metric Dimension is the question whether G has a $k$-resolving set of size at most $r$, for a given graph $G$ and a given number $r$. In this paper, we proof the NP-completeness of $k$-Metric Dimension for bipartite graphs and each $k \geq 2$.

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

↑