| 两类图的W-宽直径 |
| |
| 引用本文： | 杨春,张先迪,孙世新.两类图的W-宽直径[J].电子科技大学学报(社会科学版),2004(1). |
| |
| 作者姓名： | 杨春 张先迪 孙世新 |
| |
| 作者单位： | 电子科技大学应用数学学院 成都610054
(杨春，张先迪)，电子科技大学计算机科学与工程学院 成都610054(孙世新) |
| |
| 摘 要： | 图的直径与宽直径是并行与分布式网络通信延迟的度量,据此研究了两类图的W-宽直径,在n点圈Cn中添加t条边得到图C(n,t),讨论了图C(n,t)的2-宽直径的最小值问题,并得到其上下界,进而提出了h(n,t)精确取值的猜想;在分析联图连通度的基础上,导出了联图的W-宽直径上界估计式。
|
| 关 键 词： | 图 W-宽直径 连通度 联图 |
The W-Wide Diameter of Two Graph |
| |
| Yang Chun,Zhang Xiandi,Sun Shixin.The W-Wide Diameter of Two Graph[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),2004(1). |
| |
| Authors: | Yang Chun Zhang Xiandi Sun Shixin |
| |
| Institution: | Yang Chun1,Zhang Xiandi1,Sun Shixin2 |
| |
| Abstract: | The diameter and W-wide diameter of a graph measure delay time in a collateral and distribute net, in this paper, two kinds of W-wide diameter are studied .The first, the minimum number of 2-wide diameter of c(n,t) is studied, where graph c(n,t) is formed by adding t edges beyond a given n-cycal Cn, An upped and down bounds of h(n,t) are obtained. Fathermore, the guess accuracy number of h(n,t) is offerd At the same time, based on the analysis of the connectivity of the join graph ,an upped bound of W-wide diameter of join graph is also obtained. |
| |
| Keywords: | graph connectivity W-wide diameter bound |
| 本文献已被 CNKI 等数据库收录！ |
|
