Upper bounds on the broadcast function using minimum dominating sets

Autor:	Hovhannes A. Harutyunyan, Arthur L. Liestman
Rok vydání:	2012
Předmět:	Domatic number Discrete mathematics Large class Knödel graph Domination Graph Theoretical Computer Science Combinatorics Dominating set Discrete Mathematics and Combinatorics Broadcast function MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Discrete Mathematics. 312:2992-2996
ISSN:	0012-365X
DOI:	10.1016/j.disc.2012.06.016
Popis:	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 Knodel graphs. We also determine the domatic number of these graphs.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be166d6dd9635036d12e9ed0570faca7 https://doi.org/10.1016/j.disc.2012.06.016 Zobrazit plný text záznamu Full Text from ScienceDirect