Given a graph G = (V, E) and an originator vertex v, broadcasting is an information disseminating process of transmitting a message from the vertex v to all vertices of the graph G as quickly as possible. A graph G on n vertices is called broadcast graph if the broadcasting from any vertex in the graph can be accomplished in inverted right perpendicular log n inverted left perpendicular time. A broadcast graph with the minimum number of edges is called minimum broadcast graph. The number of edges in a minimum broadcast graph on n vertices is denoted by B(n). A long sequence of papers present d...
