Minimum multiple originator broadcast graphs

Broadcasting from multiple originators is a variant of broadcasting in which any k vertices may be the originators of a message in a network of n vertices. A minimum broadcast graph has the fewest possible edges while still allowing minimum time broadcasting from any set of k originators. We provide a census of all known such graphs.