本文已被：浏览 877次 下载 342次
投稿时间：1997-05-30
投稿时间：1997-05-30
中文摘要: 改进了文献[7]给出的广播函数B（2k-4）（k≥4）的下界，构造了一个n=2k-4的极小广播图，从而得到B（2k-4）（k≥4）的一个上界，并给出了一个mbg（28），该图的边数为48，达到B（28）的下界值．
Abstract:In this paper, we improve the lower bound of the broadcasting function B(2k-1) (k≥4)presented in the reference [7], construct a minimal broadcasting graph for n=2k-4, obtain an upper bound of B(2k-4), and give a mbg(28), whose edge number 48 reachis the lower bound of B(28).
keywords: broadcasting broadcasting time broadcasting function minimal broadcasting graph computer network
文章编号：19970303 中图分类号： 文献标志码：
基金项目:国家自然科学基金
| Author Name | Affiliation |
| Xiong Pengrong | Shangrao Teacher’s College |
| Shi Fengxian | Shanghai Institute of EIectric Power |
| Shangrao Teacher’s College | |
| Fudan University |
引用文本：
熊鹏荣,石凤仙,周玉林,等.结点数为2k-4的最小广播图[J].上海电力大学学报,1997,13(3):14-21.
Xiong Pengrong,Shi Fengxian,et al.A Minimal Broadcasting Graph with 2k-4 Nodes[J].Journal of Shanghai University of Electric Power,1997,13(3):14-21.
熊鹏荣,石凤仙,周玉林,等.结点数为2k-4的最小广播图[J].上海电力大学学报,1997,13(3):14-21.
Xiong Pengrong,Shi Fengxian,et al.A Minimal Broadcasting Graph with 2k-4 Nodes[J].Journal of Shanghai University of Electric Power,1997,13(3):14-21.