| 分层图的容错 |
| |
| 引用本文： | 李先科.分层图的容错[J].北京邮电大学学报,1996,19(3):101-104. |
| |
| 作者姓名： | 李先科 |
| |
| 作者单位： | 北京邮电大学基础科学部 |
| |
| 摘 要： | 图的容错定义是为最大的顶点数Ｋ从图中去掉任意Ｋ个顶点时，剩下的图仍连通，因此图的容错等于它的连通度减１，提出了一类分层图并分析了它的容错。
|
| 关 键 词： | 图 Cayley图 分层图 容错 通信网 |
Fault Tolerance of the Hierarchical Graphs |
| |
| Li Xianke.Fault Tolerance of the Hierarchical Graphs[J].Journal of Beijing University of Posts and Telecommunications,1996,19(3):101-104. |
| |
| Authors: | Li Xianke |
| |
| Abstract: | The fault tolerance of a graph is defined as the maximum number of vertices that can be removed from it provided that the remaining graph is still connected. Hecce, the fault tolerance of a graph is defined to be one less than its connectivity. A class of hierarchical graphs is presented and its fault tolerance is analysed. |
| |
| Keywords: | graph (mathematics) Cayley graph hierarchical graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
