Bondage Numbers of C4 Bundles over a Cycle Cn

Moo Young Sohn, Fu-Tao Hu and Jaeun Lee

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: 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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/520251

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:520251

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().