图的控制研究

Dominating and Covering of Graph

从关联矩阵和邻接矩阵出发,给出了自关联矩阵、自邻接矩阵和对图的顶点相关分割的定义,然后利用顶点的相关分割解决图的控制问题.结果表明,该方法是解决这类问题的一种简单而实用的方法.

Starting with incidence matrix and adjacency matrix,the definition of self-incidence matrix and self-adjacency matrix was given.The problem of the graphic dominating set with the help of apex correlation division was solved.It is considered to be a simple and effective solution to the kind of problem.