摘要
互联网络通常以图为模型,图的边连通度是网络可靠性的一个重要参数.文章给出了图的边连通度的下界及依赖团数的图的边连通度的下界.
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.
出处
《太原师范学院学报（自然科学版）》
2013年第2期22-24,共3页
Journal of Taiyuan Normal University:Natural Science Edition
关键词
图
边连通度
度序列
团数
graphs
edge-connectivity
degree sequence
clique number
