论文部分内容阅读
改进了文献[7]给出的广播函数B（2k-4）（k≥4）的下界，构造了一个n＝2k－4的极小广播图，从而得到B（2k-4）（k≥4）的一个上界，并给出了一个mbg（28），该图的边数为48，达到B（28）的下界值．
The lower bound of the broadcast function B (2k-4) (k≥4) given in [7] is improved and a minimal broadcast graph with n = 2k-4 is constructed. 4), and gives an mbg (28), which has 48 edges and reaches the lower bound of B (28).