Bondage Numbers of C4 Bundles over a Cycle Cn
Joint Authors
Lee, Jaeun
Sohn, Moo Young
Hu, Fu-Tao
Source
Journal of Applied Mathematics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-12-11
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
Graph bundles generalize the notion of covering graphs and graph products.
Graph bundles have been applied in computer architecture and communication networks.
The bondage number is an important parameter for measuring the vulnerability and stability of the network domination under link failure.
The bondage number b(G) of a graph G is the minimum number of edges whose removal enlarges the domination number.
In this paper, we show that the bondage number of every C4 bundles over a cycle Cn (n≥4) is equal to 4.
American Psychological Association (APA)
Sohn, Moo Young& Hu, Fu-Tao& Lee, Jaeun. 2013. Bondage Numbers of C4 Bundles over a Cycle Cn. Journal of Applied Mathematics،Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-478239
Modern Language Association (MLA)
Sohn, Moo Young…[et al.]. Bondage Numbers of C4 Bundles over a Cycle Cn. Journal of Applied Mathematics No. 2013 (2013), pp.1-5.
https://search.emarefa.net/detail/BIM-478239
American Medical Association (AMA)
Sohn, Moo Young& Hu, Fu-Tao& Lee, Jaeun. Bondage Numbers of C4 Bundles over a Cycle Cn. Journal of Applied Mathematics. 2013. Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-478239
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-478239