Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648249 | Discrete Mathematics | 2012 | 5 Pages |
Abstract
We construct new upper bounds on the broadcast function B(n)B(n), the number of edges in a minimum broadcast graph on nn vertices, for a large class of integers nn. The bounds are obtained by a construction that uses the minimum size of dominating sets for some Knödel graphs. We also determine the domatic number of these graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hovhannes A. Harutyunyan, Arthur L. Liestman,