摘要
给出了利用有向图的强连通性来判断方阵的不可约性的相关结论,并给出了相应的算法。
In this paper, the authors proved the feasibility of judging the irreducibility of matrices by use of the strong eonnexity of directed graphs, and gave the corresponding algorithm.
出处
《孝感学院学报》
2007年第3期50-51,共2页
JOURNAL OF XIAOGAN UNIVERSITY
基金
湖北省教育厅科研项目(Q200726003)
关键词
有向图
强连通性
不可约矩阵
directed graph
strong eonnexity
irreducible matrix
