@inproceedings{0e6ac9b2cc9741789d4f3443885b65b0,
title = "Computing the scattering number of bicyclic graphs",
abstract = "The scattering number of a noncomplete connected graph G is defined by s\{G) = max\{ω(G - X) - |X| : X ⊂ V(G),ω(G - X) ≥ 2\}, where ω(G - X) denotes the number of components of G - X. This parameter can be used to measure the vulnerability of networks. If an interconnection network is modelled as a graph, then the scattering number shows not only the difficulty to break down the network but also the damage that has been caused. This article includes several results on the scattering number of bicyclic graphs and a recursive algorithm for computing the scattering number of bicyclic graphs.",
keywords = "Bicyclic graph, Scattering number",
author = "Bing Chen and Shenggui Zhang",
year = "2010",
doi = "10.1109/CIS.2010.114",
language = "英语",
isbn = "9780769542973",
series = "Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010",
pages = "497--500",
booktitle = "Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010",
note = "2010 International Conference on Computational Intelligence and Security, CIS 2010 ; Conference date: 11-12-2010 Through 14-12-2010",
}