We initiate the study of minimum average time broadcast graphs - those graphs on n vertices with the fewest edges in which every vertex can broadcast in minimum average time. We find minimum average time broadcast graphs for all even n and for more than half of all odd n. In addition, we give some upper and lower bounds on the number of edges in such graphs for all n.