DocumentCode
1869783
Title
On the stability parameters of circular graph C(2n,n)
Author
Jianxiang Cao ; Zhengtao Jiang ; Weiguo Lin
Author_Institution
School of Computer Science, Communication University of China, Beijing, 100024
fYear
2012
fDate
3-5 March 2012
Firstpage
1463
Lastpage
1466
Abstract
In this paper we consider the domination number and bondage number of circular graph. These parameters can use to measure the robustness of an interconnection network with respect to link failures. By finding a minimum dominating sets we can compute the domination number and bondage number of the circular graph.
Keywords
bondage number; circular graph; domination number; domination set;
fLanguage
English
Publisher
iet
Conference_Titel
Automatic Control and Artificial Intelligence (ACAI 2012), International Conference on
Conference_Location
Xiamen
Electronic_ISBN
978-1-84919-537-9
Type
conf
DOI
10.1049/cp.2012.1257
Filename
6492864
Link To Document