Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1102.5361

Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products

Sarah Spence Adams·Zachary Brass·Connor Stokes·Denise Sakai Troxell
View original source ↗Read source document ↗Export metadata ↓

Abstract

In graph theoretical models of the spread of disease through populations, the spread of opinion through social networks, and the spread of faults through distributed computer networks, vertices are in two states, either black or white, and these states are dynamically updated at discrete time steps according to the rules of the particular conversion process used in the model. This paper considers the irreversible k-threshold and majority conversion processes. In an irreversible k-threshold (resp., majority) conversion process, a vertex is permanently colored black in a certain time period if at least k (resp., at least half) of its neighbors were black in the previous time period. A k-conversion set (resp., dynamic monopoly) is a set of vertices which, if initially colored black, will result in all vertices eventually being colored black under a k-threshold (resp., majority) conversion process. We answer several open problems by presenting bounds and some exact values of the minimum number of vertices in k-conversion sets and dynamic monopolies of complete multipartite graphs, as well as of Cartesian and tensor products of two graphs.

Explore related subjects

math.COcs.DMcs.SI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sarah Spence Adams, Zachary Brass, Connor Stokes, Denise Sakai Troxell. 2011-02-25. Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products. https://arxiv.org/abs/1102.5361

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↗