文献类型：期刊文献

英文题名：ISOLATED RUPTURE DEGREE OF TREES AND GEAR GRAPHS

作者：Li, F.[1,2]

机构：[1]Nanjing Normal Univ, Sch Math Sci, Nanjing 210023, Jiangsu, Peoples R China;[2]Shaoxing Univ, Dept Math, Shaoxing 312000, Zhejiang, Peoples R China

年份：2015

卷号：25

期号：3

起止页码：287

外文期刊名：NEURAL NETWORK WORLD

收录：SCI-EXPANDED(收录号：WOS:000358101800004)、、EI(收录号：20163802818493)、Scopus(收录号：2-s2.0-84987730758)、WOS

基金：This work was supported by Postdoctoral Science Foundation of Jiangsu Province (No.1401036C) and the NSFC(No.11401389 and 11471003). The author is thankful to anonymous referees for their constructive suggestions and critical comments, which led to this improved version.

语种：英文

外文关键词：Isolated rupture degree; vulnerability; ir-set; recursive algorithm; Cartesian product; gear graph

外文摘要：The isolated rupture degree for a connected graph G is defined as ir(G) = max{i(G-S)-vertical bar S vertical bar-m(G-S) : S is an element of C(G)}, where i(G-S) and m(G-S), respectively, denote the number of components which are isolated vertices and the order of a largest component in G-S. C(G) denotes the set of all cut-sets of G. The isolated rupture degree is a new graph parameter which can be used to measure the vulnerability of networks. In this paper, we firstly give a recursive algorithm for computing the isolated rupture degree of trees, and determine the maximum and minimum isolated rupture degree of trees with given order and maximum degree. Then, the exact value of isolated rupture degree of gear graphs are given.. In the final, we determine the rupture degree of the Cartesian product of two special graphs and a special permutation graph.