| 对一类最小图的研究 |
| |
| 引用本文： | 杨春,张先迪,孙世新.对一类最小图的研究[J].电子科技大学学报(社会科学版),2005(2). |
| |
| 作者姓名： | 杨春 张先迪 孙世新 |
| |
| 作者单位： | 电子科技大学应用数学学院 成都610054
(杨春，张先迪)，电子科技大学计算机科学与工程学院 成都610054(孙世新) |
| |
| 摘 要： | 对一个与并行结构和通信网络设计密切相关的图论公开性问题进行了研究。讨论了图的结点数为n,连通度至少为k,k-直径至多为d的条件下的最小图问题,给出了一般条件下最小图边数条数的上、下界,在此基础上,得到了两种条件下最小图边数的计算公式,结合已有的图论结果,对文中所提到的最小图进行了构造。
|
| 关 键 词： | 图 公开性问题 连通度 k-直径 直径 |
Study of One Kind of Graphs |
| |
| YANG Chun,ZHANG Xian-di,SUN Shi-xin.Study of One Kind of Graphs[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),2005(2). |
| |
| Authors: | YANG Chun ZHANG Xian-di SUN Shi-xin |
| |
| Institution: | YANG Chun1,ZHANG Xian-di1,SUN Shi-xin2 |
| |
| Abstract: | One of the open problems in the graph theory is to find the minimum number of edges required for a graph of order n. A class of graphs with connectivity of at least k and k-diameter of at most d is studied in this paper, and an upper and a lower bound of the minimum edges of the graphs under general conditions are offered. Based on this, the calculation formulas of the minimum edges in two specific situations are also given. In addition we suggest the approaches to costruct the minimum networks as mentioned above. |
| |
| Keywords: | graph open pronlem connectivity k- diameter |
| 本文献已被 CNKI 等数据库收录！ |
|
