Isolated scattering number of split graphs and graph products
Li, Fengwei ; Ye, Qingfang ; Zhang, Xiaoyan
ANZIAM Journal, Tome 58 (2017), / Harvested from Australian Mathematical Society
Link

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. doi:10.1017/S1446181117000062

Publié le : 2017-01-01
DOI : https://doi.org/10.21914/anziamj.v58i0.11019 
@article{11019,
     title = {Isolated scattering number of split graphs and graph products},
     journal = {ANZIAM Journal},
     volume = {58},
     year = {2017},
     doi = {10.21914/anziamj.v58i0.11019},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/11019}
}

Li, Fengwei; Ye, Qingfang; Zhang, Xiaoyan. Isolated scattering number of split graphs and graph products. ANZIAM Journal, Tome 58 (2017) . doi : 10.21914/anziamj.v58i0.11019. http://gdmltest.u-ga.fr/item/11019/