Extreme Tenacity of Graphs with Given Order and Size
作者机构：Department of Logistics and Maritime StudiesThe Hong Kong Polytechnic UniversityHung HomKowloonHong KongChina School of Mathematics and StatisticsQinghai University for NationalitiesXining 810000QinghaiChina Department of Applied MathematicsNorthwestern Polytechnical UniversityXi’an 710072ShaanxiChina State Key Laboratory for Manufacturing Systems EngineeringXi’an Jiaotong UniversityXi’an 710049ShaanxiChina
出 版 物：《Journal of the Operations Research Society of China》 (中国运筹学会会刊（英文）)
年 卷 期：2014年第2卷第3期
页 面：307-315页
核心收录：
学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学]
基 金：supported by National Natural Science Foundation of China(No.11271300) the Open Fund of Xi’an Jiaotong University,China(No.2010-4) the Fund of Qinghai University for Nationalities(xjz201403)
主 题：Vulnerability parameters Minimum tenacity Maximum tenacity Trees
摘 要：Computer or communication networks are so designed that they do not easily get disrupted under external attack and,moreover,these are easily reconstructible if they do get *** desirable properties of networks can be measured by various graph parameters,such as connectivity,toughness,scattering number,integrity,tenacity,rupture degree and edge-analogues of some of *** these parameters,the tenacity and rupture degree are two better ones to measure the stability of a *** this paper,we consider two extremal problems on the tenacity of graphs:determine the minimum and maximum tenacity of graphs with given order and *** give a complete solution to the first problem,while for the second one,it turns out that the problem is much more complicated than that of the minimum *** determine the maximum tenacity of trees with given order and show the corresponding extremal *** paper concludes with a discussion of a related problem on the edge vulnerability parameters of graphs.
维普期刊数据库