Broadcasting is one of the types of global communication in interconnection networks. Broadcasting from a vertex of a graph is the simplest communication problem. In this paper, we analyse the broadcasting for bloom graph and prove that the broadcast time of bloom graph is at most two time units more than the optimal time.