摘要
本文首先得到了循环图的原子部分仍为连通循环图的结果,同时还得到了连通循环图的连通度的一些性质。然后应用这些结果与循环图的理论,得到了5,7,8,9度连通循环图的连通度等于其度数的充要条件,从而可构造出5,7,8,9度可靠通讯网络。
This paper argues first that atomic parts of a connected circular graph are still connected circular graphs. It also gives some natures about connectivity of connected circular graphs. Then by using these results and circular graph theories, the sufficient and necessary condition that connectivity of 5 , 7 , 8 , 9 connected circular graphs is equal to its degrees is obtained so that reliable communication networks with 5 , 7 , 8 , 9 degrees can be constructed.
出处
《甘肃工业大学学报》
1990年第2期82-90,共9页
Journal of Gansu University of Technology
基金
甘肃省自然科学基金资助课题
关键词
通讯网络
图论
连通图
循环
graph theory, connected graphs, circulation, communication networks, cut set
