Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0805.0181

Nondiscriminatory Propagation on Trees

Simone Severini
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider a discrete-time dynamical process on graphs, firstly introduced in connection with a protocol for controlling large networks of spin 1/2 quantum mechanical particles [Phys. Rev. Lett. 99, 100501 (2007)]. A description is as follows: each vertex of an initially selected set has a packet of information (the same for every element of the set), which will be distributed among vertices of the graph; a vertex v can pass its packet to an adjacent vertex w only if w is its only neighbour without the information. By mean of examples, we describe some general properties, mainly concerning homeomorphism, and redundant edges. We prove that the cardinality of the smallest sets propagating the information in all vertices of a balanced m-ary tree of depth k is exactly (m^{k+1}+(-1)^{k})/(m+1). For binary trees, this number is related to alternating sign matrices.

Explore related subjects

math.COquant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Simone Severini. 2008-05-02. Nondiscriminatory Propagation on Trees. https://doi.org/10.1088/1751-8113%2F41%2F48%2F482002

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↗