文献类型：会议论文

英文题名：On Integrity of Harary Graphs

作者：Li, Fengwei[1];Ye, Qingfang[1];Sheng, Baohurai[1]

机构：[1]Shaoxing Univ, Dept Math, Shaoxing 312000, Zhejiang, Peoples R China

会议论文集：3rd International Conference on Combinatorial Optimization and Applications

会议日期：JUN 10-12, 2009

会议地点：Huangshan, PEOPLES R CHINA

语种：英文

外文关键词：Networks; Integrity; Harary Graph; Independence Number

外文摘要：The integrity of a graph G = (V, E) is defined as I(G) = min{vertical bar S vertical bar+m(G-S) : S subset of V(G)}, where m(G-X) denotes the order of tire largest component in the graph G-X. This is a better parameter to measure the stability of a network G, as it takes into account both the amount of work done to damage the network and how badly the network is damaged. In this paper, we give the exact values or bounds for the integrity of Harary graphs.