Modelling simultaneous broadcasting by level-disjoint partitions

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

Applied Mathematics and Computation, 2018, vol. 325, issue C, 15-23

Abstract: Simultaneous broadcasting of multiple messages from the same source vertex in synchronous networks is considered under restrictions that each vertex receives at most one message in a unit time step, every received message can be sent out only in the next time step, no message is sent to already informed vertices. The number of outgoing messages is unrestricted, messages have unit length, and we assume full-duplex mode. In Gregor et al. (2015), we developed a concept of level-disjoint partitions to study simultaneous broadcasting under this model. In this work, we consider the optimal number of level-disjoint partitions. We also provide a necessary condition in terms of eccentricity and girth on existence of k v-rooted level-disjoint partitions of optimal height. In particular, we provide a structural characterization of graphs admitting two level-disjoint partitions with the same root.

Keywords: Simultaneous broadcasting; Multiple message broadcasting; Level-disjoint partitions; Interconnection networks (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317308779
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:325:y:2018:i:c:p:15-23

DOI: 10.1016/j.amc.2017.12.018

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 ().