Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.06552

On leaky forcing and resilience

Joseph S. Alameda·Jürgen Kritschgau·Nathan Warnberg·Michael Young
View original source ↗Read source document ↗Export metadata ↓

Abstract

A leak is a vertex that is not allowed to perform a force during the zero forcing process. Leaky forcing was recently introduced as a new variation of zero forcing in order to analyze how leaks in a network disrupt the zero forcing process. The $\ell$-leaky forcing number of a graph is the size of the smallest zero forcing set that can force a graph despite $\ell$ leaks. A graph $G$ is $\ell$-resilient if its zero forcing number is the same as its $\ell$-leaky forcing number. In this paper, we analyze $\ell$-leaky forcing and show that if an $(\ell-1)$-leaky forcing set $B$ is robust enough, then $B$ is an $\ell$-leaky forcing set. This provides the framework for characterizing $\ell$-leaky forcing sets. Furthermore, we consider structural implications of $\ell$-resilient graphs. We apply these results to bound the $\ell$-leaky forcing number of several graph families including trees, supertriangles, and grid graphs. In particular, we resolve a question posed by Dillman and Kenter concerning the upper bound on the $1$-leaky forcing number of grid graphs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph S. Alameda, Jürgen Kritschgau, Nathan Warnberg, Michael Young. 2020-08-14. On leaky forcing and resilience. https://arxiv.org/abs/2008.06552

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↗