| 利用有向图的强连通性判断方阵的不可约性 |
| |
| 引用本文： | 苏清华,郭淑会. 利用有向图的强连通性判断方阵的不可约性[J]. 孝感学院学报, 2007, 27(3): 50-51 |
| |
| 作者姓名： | 苏清华 郭淑会 |
| |
| 作者单位： | 孝感学院,数学系,湖北,孝感,432100 |
| |
| 摘 要： | 给出了利用有向图的强连通性来判断方阵的不可约性的相关结论,并给出了相应的算法。
|
| 关 键 词： | 有向图 强连通性 不可约矩阵 |
| 文章编号： | 1671-2544（2007）03-0050-02 |
| 收稿时间： | 2006-11-22 |
| 修稿时间： | 2006-11-22 |
Judging the Irreducibility of Matrices by Use of the Strong Connexity of Directed Graphs |
| |
| Su Qinghua,Guo Shuhui. Judging the Irreducibility of Matrices by Use of the Strong Connexity of Directed Graphs[J]. JOURNAL OF XIAOGAN UNIVERSITY, 2007, 27(3): 50-51 |
| |
| Authors: | Su Qinghua Guo Shuhui |
| |
| Affiliation: | Department of Mathematics, Xiaogan University, Xiaogan, Hubei 432000, China |
| |
| Abstract: | In this paper,the authors proved the feasibility of judging the irreducibility of matrices by use of the strong connexity of directed graphs,and gave the corresponding algorithm. |
| |
| Keywords: | directed graph strong connexity irreducible matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
