| 循环图的最佳连通性 |
| |
| 引用本文： | 周永生.循环图的最佳连通性[J].兰州理工大学学报,1991(2). |
| |
| 作者姓名： | 周永生 |
| |
| 作者单位： | 甘肃工业大学基础课教学研究部 |
| |
| 摘 要： | 本文依据连通循环图有关连通度的性质,得到连通循环图具有最佳连通性的充要条件。依据这一充要条件,可判定一个连通循环图是否具有最佳连通性。
|
| 关 键 词： | 最佳连通性 原子部分 顶点割 排列 标号 度 |
The Best Connectedness of Circular Graphs |
| |
| Zhou Yongsheng.The Best Connectedness of Circular Graphs[J].Journal of Lanzhou University of Technology,1991(2). |
| |
| Authors: | Zhou Yongsheng |
| |
| Institution: | Department of Basic Courses Teaching |
| |
| Abstract: | Based on relevant features of connected circulant graphs,the sufficient and necessary condition for obtaining the best connectedness is derived in this paper. According to this condition, one can decide whether or not a connected circulant graph has the best connectedness. |
| |
| Keywords: | the best connectedness atomic part vertex cut permutation labeling degree |
| 本文献已被 CNKI 等数据库收录！ |
