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

关于无三角形图的识别码的大小

On the size of identifying codes in triangle-free graphs

Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud

摘要:

在无向图$G$中,一个子集$C\subseteq V(G)$,使得$C$是$G$的支配集,并且$V(G)$中的每个顶点都被来自$C$的一个不同的顶点子集支配,称为$G$的标识码。识别码的概念是由Karpovsky,Chakrabarty和Levitin在1998年提出的。对于给定的可识别图$G$,令$\M(G)$是$G$中的识别码的最小基数。本文证明了:对于任意连通可识别无三角形图$G$,$n$上的顶点具有最大度$Δ\geq 3$,$\M(G)\le n-\tfrac{n}{Δ+o(Δ)}$ .这个界限是渐近紧的常数,由于各种类别的图,包括$(Δ-1)$ -ary树,这是已知的有其最小识别码的大小$n-\tfrac{n}{Δ-1+o(1)}$。我们还提供了改进的限制性的无三角形图的子族的界限,并猜想存在一些常数$c$,使得界$\M(G)\le n-\tfrac{n}Δ+c$保持任何非平凡的连接可识别图$G$。

英文摘要:

In an undirected graph $G$, a subset $C\subseteq V(G)$ such that $C$ is a dominating set of $G$, and each vertex in $V(G)$ is dominated by a distinct subset of vertices from $C$, is called an identifying code of $G$. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph $G$, let $\M(G)$ be the minimum cardinality of an identifying code in $G$. In this paper, we show that for any connected identifiable triangle-free graph $G$ on $n$ vertices having maximum degree $Δ\geq 3$, $\M(G)\le n-\tfrac{n}{Δ+o(Δ)}$. This bound is asymptotically tight up to constants due to various classes of graphs including $(Δ-1)$-ary trees, which are known to have their minimum identifying code of size $n-\tfrac{n}{Δ-1+o(1)}$. We also provide improved bounds for restricted subfamilies of triangle-free graphs, and conjecture that there exists some constant $c$ such that the bound $\M(G)\le n-\tfrac{n}Δ+c$ holds for any nontrivial connected identifiable graph $G$.

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

↑