Research on the Stability of Two Special Networks

Abstract

It is known that the topological structure of an interconnection network can be modelled by a connected graph whose vertices represent sites of the network and whose edges represent the communication links. So many problems about networks can be converted to the study of graphs. The domination number of graphs is an important parameter and it has been used to measure the robustness of an interconnection network. But it has been proved that calculating the domination number of graph is a NP-complete problem, and it is also difficult to give the better boundary domination number of the graph, we only can calculate some special graphs which have some special structure. In this paper we consider the domination number of two special networks.