Rooted level-disjoint partitions of Cartesian products

Petr Gregor, Riste Škrekovski and Vida Vukašinović

Applied Mathematics and Computation, 2015, vol. 266, issue C, 244-258

Abstract: In interconnection networks one often needs to broadcast multiple messages in parallel from a single source so that the load at each node is minimal. With this motivation we study a new concept of rooted level-disjoint partitions of graphs. In particular, we develop a general construction of level-disjoint partitions for Cartesian products of graphs that is efficient both in the number of level partitions as in the maximal height. As an example, we show that the hypercube Q n for every dimension n=3·2i or n=4·2i where i ≥ 0 has n level-disjoint partitions with the same root and with maximal height 3n−2. Both the number of such partitions and the maximal height are optimal. Moreover, we conjecture that this holds for any n ≥ 3.

Keywords: Broadcasting; Level-disjoint partitions; Cartesian product; Hypercube (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315006839
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:266:y:2015:i:c:p:244-258

DOI: 10.1016/j.amc.2015.05.059

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().