Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2112.01685

Fault-tolerant Identifying Codes in Special Classes of Graphs

Devin C. Jean·Suk J. Seo
View original source ↗Read source document ↗Export metadata ↓

Abstract

A detection system, modeled in a graph, is composed of "detectors" positioned at a subset of vertices in order to uniquely locate an ``intruder" at any vertex. \emph{Identifying codes} use detectors that can sense the presence or absence of an intruder within distance one. We introduce a fault-tolerant identifying code called a \emph{redundant identifying code}, which allows at most one detector to go offline or be removed without disrupting the detection system. In real-world applications, this would be a necessary feature, as it would allow for maintenance on individual components without disabling the entire system. Specifically, we prove that the problem of determining the lowest cardinality of an identifying code for an arbitrary graph is NP-complete, we determine the bounds on the lowest cardinality for special classes of graphs, including trees, cylinders, and cubic graphs.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Devin C. Jean, Suk J. Seo. 2021-12-03. Fault-tolerant Identifying Codes in Special Classes of Graphs. https://arxiv.org/abs/2112.01685

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗