Abstract
The design of networks using broadcast media so that every two sites lie on a common link, subject to constraints on the number of links at each site (degree), and the number of sites on each link (link size), is examined. A method proposed by Yener et al. is shown to fail, in general, to achieve the minimum link size for a specified degree constraint. The existence of (k,n)-arcs in projective planes is employed to improve upon their results.
Original language | English (US) |
---|---|
Pages (from-to) | 117-126 |
Number of pages | 10 |
Journal | Discrete Applied Mathematics |
Volume | 122 |
Issue number | 1-3 |
DOIs | |
State | Published - Oct 15 2002 |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics