Broadcasting in Sierpinski gasket graphs

Broadcasting is a fundamental information dissemination problem in a connected graph, in which one vertex called the originator, disseminates one or more messages to all other vertices in the graph, k-broadcasting is a variant of broadcasting in which an informed vertex can disseminate message to at most k uninformed vertices in one unit of time. In general, solving the broadcast problem in an arbitrary graph is NP-complete. In this paper, we obtain the k-broadcast time of the Sierpinski gasket graphs for all k ≥ 1.