Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.07854

Fault Tolerant Zero Forcing

Asher Brown·Mark Hunnell·Za'Kiyah Toomer-Sanders·Via Weber
View original source ↗Read source document ↗Export metadata ↓

Abstract

Zero forcing is an iterative graph coloring process studied for its wide array of applications. In this process, the vertices of the graph are initially designated as blue or white, and a zero forcing set is a set of initially blue vertices that results in all vertices becoming blue after repeated application of a color change rule. The zero forcing number of a graph is the minimum cardinality of a zero forcing set. The zero forcing number has motivated the introduction of a host of variants motivated by linear-algebraic or graph-theoretic contexts. We define a variant we term the $k$-fault tolerant zero forcing number, which is the minimum cardinality of a set $B$ such that every subset of $B$ of cardinality $|B|-k$ is a zero forcing set. We study the values of this parameter on various graph families, the behavior under several graph operations, and characterize the 1-fault tolerant zero forcing number of trees.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Asher Brown, Mark Hunnell, Za'Kiyah Toomer-Sanders, Via Weber. 2026-08-24. Fault Tolerant Zero Forcing. https://arxiv.org/abs/2509.07854

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗