|
%I #9 Nov 21 2014 09:10:29
%S 0,2,3,8,7,12,14,24,16,20,22,24
%N Minimal number of edges in any broadcast graph with n nodes.
%C The sequence (for n >= 13) continues 29-33, 42, 45, 64, 24-34, 36, 38-39, ...
%H Arthur L. Liestman, and Joseph G. Peters, <a href="http://dx.doi.org/10.1016/0166-218X(92)90148-4">Minimum broadcast digraphs</a>, Discrete Applied Mathematics 37 (1992): 401-419.
%K nonn,more
%O 1,2
%A _N. J. A. Sloane_, Nov 20 2014
|
