It is proved that a graph G is a bipartite graph if and only if every odd-order princpal minor of the adjacecy matrix A (G) of G is singular.
本文证明了：图G是二部图当且仅当其邻接矩阵A（G）的任一个奇阶主子阵是奇异阵。
参考来源 - 二部图的邻接矩阵的特征We discuss a method reducing data size by deleting vertices with low degreein a bipartite graph.
探讨了删除二部图中低度数顶点来缩小数据规模的方法。
参考来源 - 数据挖掘的关联规则研究·2,447,543篇论文数据，部分数据来源于NoteExpress
得到了扇和完全等二部图联图的边色数。
The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.
这个图不是二部图，因为里面存在许多三角形。
This graph is NOT bipartite, since there are many triangles in it.
二部图是数据库等应用系统的重要的数据结构。
Bipartite Graph is important data structure for data base system etc.
应用推荐