Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2411.02050

The 2-burning number of a graph

C. B. Jacobs·M. E. Messinger·A. N. Trenk
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study a discrete-time model for the spread of information in a graph, motivated by the idea that people believe a story when they learn of it from two different origins. Similar to the burning number, in this problem, information spreads in rounds and a new source can appear in each round. For a graph $G$, we are interested in $b_2(G)$, the minimum number of rounds until the information has spread to all vertices of graph $G$. We are also interested in finding $t_2(G)$, the minimum number of sources necessary so that the information spreads to all vertices of $G$ in $b_2(G)$ rounds. In addition to general results, we find $b_2(G)$ and $t_2(G)$ for the classes of spiders and wheels and show that their behavior differs with respect to these two parameters. We also provide examples and prove upper bounds for these parameters for Cartesian products of graphs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

C. B. Jacobs, M. E. Messinger, A. N. Trenk. 2024-11-13. The 2-burning number of a graph. https://arxiv.org/abs/2411.02050

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↗