摘要
本文讨论了布尔矩阵的组合合成的基本性质，用图论方法找出了２级组合合成阵为不可约的一些充分条件。
The fundamental property of Combinatorial Compound of Boolean Matrices have been investigating. By graph-theoretial technigues,some sufficient conditions for irreducibirity of 2-th Combinatorial compound matrices have been found.
出处
《青海师范大学学报（自然科学版）》
1998年第3期25-30,共6页
Journal of Qinghai Normal University(Natural Science Edition)
关键词
组合合成阵
可约性
伴随图
强连通性
布尔矩阵
Combinatorial Compound matrix
reducibility
associated digraph
strong connectivity.
