| 图边连通度的下界 |
| |
| 引用本文： | 王晓丽.图边连通度的下界[J].太原师范学院学报(自然科学版),2013(2):22-24. |
| |
| 作者姓名： | 王晓丽 |
| |
| 作者单位： | 晋中学院数学学院,山西晋中030600 |
| |
| 摘 要： | 互联网络通常以图为模型,图的边连通度是网络可靠性的一个重要参数.文章给出了图的边连通度的下界及依赖团数的图的边连通度的下界.
|
| 关 键 词： | 图 边连通度 度序列 团数 |
Lower Bounds on the Edge-Connectivity of Graphs |
| |
| Wang Xiaoli.Lower Bounds on the Edge-Connectivity of Graphs[J].Journal of Taiyuan Normal University:Natural Science Edition,2013(2):22-24. |
| |
| Authors: | Wang Xiaoli |
| |
| Institution: | Wang Xiaoli (School of Mathematics,Jinzhong University,Jinzhong 030600,China) |
| |
| Abstract: | Since interconnection networks are often modeled by graphs, the edge-connec- tivity of a graph is an important measurement for fault tolerance of networks. We present lower bounds on the edge-connectivity of graphs and graphs depending on the clique number. |
| |
| Keywords: | graphs edge-connectivity degree sequence clique number |
| 本文献已被 CNKI 维普 等数据库收录！ |
