每个非空正则简单图都包含两个不相交的极大独立集

EVERY NONEMPTY PEGULAR SIMPLE GRAPH IMPLICATIOM TWO NO CROSSING VERY BIG SEPARTED SET

以极大独立集定义为基础，从连通简单图的邻接矩阵入手，寻求邻接矩阵的极高阶零子方阵，以极高阶零子方阵确定极大独立集。

on the basis of the comcept of set of the maximal independent,by begin the contiguous matrix of connected simple graph,Seek madimum order zero--matrix,The maximum order zero--matrix defines the set of the maximal independent points.Thus the thorem is proved,