In these years, due to the impact of large-scale data analysis and processing requirements, generally multiprocessor systems are required to have larger size, the higher ability of processing and better stability. It is to say that when we design and select a topological structure for an interconnection network, reliability is a significant measure for evaluating the performance of network. But with the increase in size and processing speed, it is inevitable that some processors in such a system may fail. So it is important to know how to measure the stability of the multiprocessor systems. In general, the multiprocessor system corresponds to the network and the connection between processors corresponds to the edge of the network. And the mathematical model of network is graph, such a close interrelation between graph theory and network motivates us to investigate the domination-stability of graphs. We consider the domination number and the effect of edge operations on the domination number which reveal the domination-stability of graphs. In this paper, we mainly focus on two parameters-domination number and bondage number of n-C m and n•C m . We obtain the domination number and bondage number of n-C m and n•C m .