Author:
LI FENGWEI,YE QINGFANG,ZHANG XIAOYAN
Abstract
Computer or communication networks are so designed that they do not easily get disrupted under external attack. Moreover, they are easily reconstructed when they do get disrupted. These desirable properties of networks can be measured by various parameters, such as connectivity, toughness and scattering number. Among these parameters, the isolated scattering number is a comparatively better parameter to measure the vulnerability of networks. In this paper we first prove that for split graphs, this number can be computed in polynomial time. Then we determine the isolated scattering number of the Cartesian product and the Kronecker product of special graphs and special permutation graphs.
Publisher
Cambridge University Press (CUP)
Subject
Mathematics (miscellaneous)
Reference23 articles.
1. Optimal design of diagnosable systems on networks constructed by graph operations;Arika;Electron. Commun. Japan,2002
2. Rupture degree of graphs
3. On isolated rupture degree of graphs;Li;Util. Math.,2015
4. Tough graphs and hamiltonian circuits
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献