Title of article
Upper bounds on the broadcast function using minimum dominating sets
Author/Authors
Harutyunyan، نويسنده , , Hovhannes A. and Liestman، نويسنده , , Arthur L.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
5
From page
2992
To page
2996
Abstract
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.
Keywords
domination , domatic number , Broadcast function , Knِdel graph
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1600111
Link To Document