Abstract: The problem of information dissemination on network is studied,where any vertex vi that has information can transmits its information to at most ki(ki≥1) neighbors simultaneously per a unit time.The objective of this problem is to minimize the broadcasting time such that all vertices in the network can received this information.Since this problem is NP-complete in an arbitrary network,the special network called a hypercube of m-dimensions is studied.By using the technique of induction,many good features as well as some interesting characteristics in this hypercube are given,which shows that hypercube is the optimal structure to information dissemination.