Bondage Numbers of C-4 Bundles over a Cycle C-n

Title
Bondage Numbers of C-4 Bundles over a Cycle C-n
Author(s)
이재운손무영[손무영]Fu-Tao Hu[Fu-Tao Hu]
Keywords
GRAPH
Issue Date
201312
Publisher
HINDAWI PUBLISHING CORPORATION
Citation
JOURNAL OF APPLIED MATHEMATICS
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 C-4 bundles over a cycle C-n (n >= 4) is equal to 4.
URI
http://hdl.handle.net/YU.REPOSITORY/28273http://dx.doi.org/10.1155/2013/520251
ISSN
1110-757X
Appears in Collections:
이과대학 > 수학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE