Some Results of Bondage Number of (n,k)-Star Graphs
Yunchao Wei, Hongxian Zhu, Junli Han · TELKOMNIKA Indonesian Journal of Electrical Engineering · 2013
In the computer network, bondage number is one of the most important parameters to measure the control theory of the computer network, denoted by b(G) for a network graph G. But predecessors have proved that computing them are very hard. So computing b(G) of some particular known gr-aphs is extremely valuable. In this paper, we determine b(S n,2 ) and the precise lowerbound of b(G) of (n,k)-star graphs, denoted by S n,k followed by some relative conclusions of n-star, denoted by S n as the isomorphism of S n,n-1 . In addition, our method giving dominating set of S n,k is easily understood, which presented a broadcast algorithm to determine dominating set of S n,k . DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3285