结点数为2^k—6的最小广播图

Minimum Broadcasting Graphs with 2~k - 6 Nodes

广播是信息在网络上的一种传播过程，在这个过程中，一个结点将信息传递给所有其他结点．本文绘出了广播函数B（2k-6）（k≥4）的下界，并给出了一个mbg（26），该图的边数为42，达到了B（26）的下界值．

Broadcasting is a message propagation process over a netWorks, by which a message originated at one of the nodes becomes known to all other nodes in the network. This paper determines the lower bound of the broadcasting function B(2k - 6), and gives a mbg(n), whose edge number 42 reachs the lower bound of B(26).