The Stability Of The Incidence Domination In Graphs

The theory of theoretical knowledge of the graph has gone through the past three centuries since the date of birth and so far. The coloring theory of the graphs goes from point to side, and then to a particular evolutionary process. Then, the control theory as a graph theory and its important part, will also experience such a process. So the control theory of the graph began to germinate from the point of view, through the study of the opposite side. With the deepening of the study of classical control theory and the concrete requirements of reality in reality,scientists have put forward a variety of control theories, the classical control theory is the foundation (these theories either through the evolution of classical control Or to the classic control of the restrictions imposed by the corresponding)We study the stability of the graph control and give the number of correlation control of the partial graphs. The control parameter is the number of the minimum control set elements. In the process of exploring the parameters, we will focus on the minimum control set Of the relevant nature, and will explore the corresponding parameters). The concept of association control and the concept of reinforcement number and constraint number are merged, and the definition of correlation enhancement number and association constraint number is proposed. The stability of correlation control is embodied by the number of association enhancement and the number of association constraints. Fink first used the number of constraints to calculate the stability of the interconnection network. In the Internet (Figure) at least delete a few sides, will allow the Internet (Figure) control parameters become larger, then remove the number of sides is the number of constraints. Since the number of control and the number of correlation control have been determined as N-P problem, the correlation enhancement number and the correlation constraint number are also N-P problem. In this paper, the exact value of the correlation enhancement number and the correlation constraint number of several special graphs are given.