Upper bounds on the broadcast function using minimum dominating sets

We construct new upper bounds on the broadcast function B ( n ) , the number of edges in a minimum broadcast graph on n vertices, for a large class of integers n . 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.