Computing the scattering number of bicyclic graphs

Bing Chen; Shenggui Zhang

doi:10.1109/CIS.2010.114

Computing the scattering number of bicyclic graphs

Bing Chen, Shenggui Zhang

School of Mathematics and Statistics

Xi'an University of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010
Pages	497-500
Number of pages	4
DOIs	https://doi.org/10.1109/CIS.2010.114
State	Published - 2010
Event	2010 International Conference on Computational Intelligence and Security, CIS 2010 - Nanning, China Duration: 11 Dec 2010 → 14 Dec 2010

Publication series

Name	Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010

Conference

Conference	2010 International Conference on Computational Intelligence and Security, CIS 2010
Country/Territory	China
City	Nanning
Period	11/12/10 → 14/12/10

Keywords

Bicyclic graph
Scattering number

Access to Document

10.1109/CIS.2010.114

Cite this

@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",

}

Chen, B & Zhang, S 2010, Computing the scattering number of bicyclic graphs. in Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010., 5696330, Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010, pp. 497-500, 2010 International Conference on Computational Intelligence and Security, CIS 2010, Nanning, China, 11/12/10. https://doi.org/10.1109/CIS.2010.114

Computing the scattering number of bicyclic graphs. / Chen, Bing; Zhang, Shenggui.
Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010. 2010. p. 497-500 5696330 (Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Computing the scattering number of bicyclic graphs

AU - Chen, Bing

AU - Zhang, Shenggui

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Bicyclic graph

KW - Scattering number

UR - http://www.scopus.com/inward/record.url?scp=79951617663&partnerID=8YFLogxK

U2 - 10.1109/CIS.2010.114

DO - 10.1109/CIS.2010.114

M3 - 会议稿件

AN - SCOPUS:79951617663

SN - 9780769542973

T3 - Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010

SP - 497

EP - 500

BT - Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010

T2 - 2010 International Conference on Computational Intelligence and Security, CIS 2010

Y2 - 11 December 2010 through 14 December 2010

ER -

Computing the scattering number of bicyclic graphs

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this