More broadcast graphs
Let \(G\) be a graph. Broadcasting in \(G\) is the process of spreading information from one vertex, which knows the information, throughout \(G\) so that, in each time unit, any vertex which knows the information can pass it to at most one of its neighbours. Denote by \(B(n)\) the minimum number of edges over all graphs of order \(n\) which allow any vertex to broadcast in time \(\left\lceil \log n\right\rceil \). In the paper a new upper bound on \(B(n)\) is provided for some values of \(n\).
scientific article; zbMATH DE number 1389500
scientific article