EXTREME VALUES OF THE TENACITY OF GRAPHS

摘要：

The tenacity of a graph G(V,E) is defined as min(｜S｜+m(G-S))/ω(G-S):S(∩)V(G),ω(G-S)≥2, where ω(G-S)and m(G-S)denote the number of components and the order of a largest component in G-S respectively. This is a better parameter to measure the stability of a network G, as it takes into account both the quantity and the order of components of the graph G-S. In this paper, the minimum tenacity of a graph is obtained with prescribed order and edge, and a method for constructing this sort of networks is also presented.

关键词： Tenacity Communication network Optimization design

作者: ZHIPING WANG JUJUAN ZHUANG

作者单位: Department of mathematics, Dalian Maritime University, Dalian, China, 116026

会议类型: 国际会议

会议名称: The Second International Conference on Information & Systems Sciences(ICISS2008)(第二届信息与系统科学国际会议)

会议地点: 大连

会议语种:英文

页码: 1059-1065

在线出版日期: 2008-12-18（万方平台首次上网日期，不代表论文的发表时间）