Nondiscriminatory Propagation on Trees

Details Nondiscriminatory Propagation on Trees Nondiscriminatory Propagation on Trees

2008-05-02

arxiv.org/abs/0805.0181v1

Mathematics

Combinatorics

5 pages, 7 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Nondiscriminatory Propagation on Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nondiscriminatory Propagation on Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nondiscriminatory Propagation on Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-340839