scientific article; zbMATH DE number 3859049

From MaRDI portal
Publication:3328474





[For the entire collection see Zbl 0532.00009.] In this paper a broadcast network with a common radio channel is considered. It is assumed that a message transmitted by one site is received correctly by another site only if, at the same time, this latter site is neither transmitting nor within range of another transmitting site. Next, a graph-theoretical model of the network is formulated. A few sets of vertices which represent network sites are then defined. The authors introduce a new aspect of such analyses and define open irredundant sets (OIR) of vertices. It is proved that OIR sets are sending sets, i.e. sets of sites which can successfully transmit their messages at the same time. A few theorems giving relationships between orders of OIR sets and other graph parameters are proved. In addition, an important duality property of OIR, allowing their maximum orders to be computed, is established.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328474)