Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.disc.2012.06.016 | Discrete Mathematics |
Keywords | Field | DocType |
Domination,Domatic number,Broadcast function,Knödel graph | Integer,Graph,Discrete mathematics,Broadcasting,Combinatorics,Dominating set,Vertex (geometry),Mathematics,Domatic number | Journal |
Volume | Issue | ISSN |
312 | 20 | 0012-365X |
Citations | PageRank | References |
14 | 0.64 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hovhannes A. Harutyunyan | 1 | 206 | 28.18 |
| Arthur L. Liestman | 2 | 1240 | 169.30 |