图的边割的矩阵判别法

The Matrix Discriminance about Edge Cut of Graph

对以往文献给出的割边的关联矩阵判别法进行了分析,结果表明,按照代宏霞文章《图的割点的矩阵判别的推广》中给出的图G-S的关联矩阵的定义,不能处理某些特殊的图,因此对图G-S的关联矩阵给出新定义,并将上述文献的结论进行了推广,进而得到无向图、有向图的边割的矩阵判别法.

This paper makes some analysis on the matrix discriminance about cut-edge of graph from past literature, and the result shows that some special graph can not be processed based on the definition of the incidence matrix of graphin paper. This paper redefines the incidence matrix of graph, and generalizes the conclusion in the paper, then gets the matrix discriminance about edge cut of undirected graph and digraph.