本文已被：浏览 810次 下载 343次
投稿时间：1997-10-27
投稿时间：1997-10-27
中文摘要: 广播是信息在网络上的一种传播过程，在这个过程中，一个结点将信息传递给所有其他结点．本文绘出了广播函数B（2k<\sup> -6）（k≥4）的下界，并给出了一个mbg（26），该图的边数为42，达到了B（26）的下界值．
Abstract: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<\sup> - 6), and gives a mbg(n), whose edge number 42 reachs the lower bound of B(26).
keywords: broadcasting broadcasting time broadcasting function minimum broadcasting graph computer network
文章编号：19970410 中图分类号： 文献标志码：
基金项目:国家自然科学基金
| Author Name | Affiliation |
| Xiong Pengrong | Shangrao Teacher’s College |
| Shi Fengxian | Shanghai Institure of Electric Power |
| Shangrao Teacher’s College | |
| Fudan University |
引用文本：
熊鹏荣,石凤仙,周玉林,等.结点数为2~k-6的最小广播图[J].上海电力大学学报,1997,13(4):57-61.
Xiong Pengrong,Shi Fengxian,et al.Minimum Broadcasting Graphs with 2~k - 6 Nodes[J].Journal of Shanghai University of Electric Power,1997,13(4):57-61.
熊鹏荣,石凤仙,周玉林,等.结点数为2~k-6的最小广播图[J].上海电力大学学报,1997,13(4):57-61.
Xiong Pengrong,Shi Fengxian,et al.Minimum Broadcasting Graphs with 2~k - 6 Nodes[J].Journal of Shanghai University of Electric Power,1997,13(4):57-61.