| 图的连通分支数的邻接矩阵判定 |
| |
| 引用本文： | 王晓.图的连通分支数的邻接矩阵判定[J].商洛学院学报,2014(6):6-7,22. |
| |
| 作者姓名： | 王晓 |
| |
| 作者单位： | 商洛学院数学与计算机应用学院 |
| |
| 基金项目： | 陕西省教育厅专项科研计划项目(12JK0889) |
| |
| 摘 要： | 连通性是图的基本性质之一,由定义来判断顶点数和边数较大的图的连通性和连通分支数比较困难。结合图的邻接矩阵,给出判断图的连通性的两个充要条件,并给出判断图的连通分支数的一个充要条件和非负对称不可约矩阵的一个充要条件。
|
| 关 键 词： | 图的连通性 连通分支数 邻接矩阵 |
Judgment for Number of Connected Components of Graph with Adjacency Matrix |
| |
| WANG Xiao.Judgment for Number of Connected Components of Graph with Adjacency Matrix[J].Journal of Shangluo University,2014(6):6-7,22. |
| |
| Authors: | WANG Xiao |
| |
| Institution: | WANG Xiao;College of Mathematics and Computer Application, Shangluo University; |
| |
| Abstract: | The connectivity is one of the basic properties for a graph. It is difficult to judge the number of connected component for graphs which have a large number of vertices and edges. With adjacency matrix of graphs, two necessary and sufficient conditions on the connectivity for graphs are given, a necessary and sufficient condition on judgment of the number of connected components for a graph is obtained, a necessary and sufficient condition on non-negative symmetric irreducible matrix is given. |
| |
| Keywords: | connectivity of graphs number of connected component adjacency matrix |
| 本文献已被 CNKI 维普 等数据库收录！ |
