Research of Distance Domination Numbers for Bubblesort-star Networks
Wang Guo-liang · 2012
For any positive integer l and any graph G=(V,E),a set D of vertices of G is said to be an l-dominating set if every vertex in V(G)-D is at distance at most l from some vertex in D.l-domination number γl(G) is the minimum cardinality of an l-domination set of G.1-domination number is also called domination number and is ofen denoted by γ(BSn).The bounds of domination number and the distance 2-domination number as well as distance 3-domination number of n-dimensional Bubblesort-star network are investigated in this paper.And above the bounds are improved for some low dimensional Bubblesort-star networks.