Periodic gossiping in back-to-back trees Original Research Article

The d-ary back-to-back tree of height k, BBTkd, consists of two complete d-ary trees of height k the leaves of which are identified. For a proper coloring of the edges of BBTkd with c ⩾ d + 1 colors, we consider periodic gossiping, i.e. full-duplex all-to-all broadcasting in the 1-port model where communication is made on a link of color i at any time (round)  i mod c.