布尔矩阵平方根问题及其与图着色问题的关系

讨论了布尔矩阵平方根问题及其与图着色问题的关系.首先得到有平方根的布尔矩阵具有的一些性质;然后给出布尔矩阵存在平方根的一个充要条件;最后证明布尔矩阵的平方根问题可以转化为简单图的着色问题.     

可实现布尔矩阵的容度与无向图的团覆盖数

讨论了可实现布尔矩阵的容度问题.将可实现布尔矩阵看成是无向图,我们证明了可实现布尔矩阵的容度等于其相应无向图的团覆盖数与孤立点数之和,并给出了通过计算容度来计算团覆盖数,以及通过计算团覆盖数来计算容度的算法框架.     

Fuzzy矩阵Schein秩的计算复杂性

本文讨论Fuzzy矩阵Schein秩的计算复杂性问题,证明了它是一个"NP-完全问题".首先,刻画了交可分解的Puzzy关系的交分解解集.然后,从Fuzzy关系的交分解与广义分解之间的关系出发,给出了Fuzzy关系广义分解的算法.最后,从Fuzzy关系广义分解的角度来讨论Fuzzy矩阵的Schein秩.指出它与色数问题之间的关系,即Fuzzy矩阵的Schein秩等于由它生成的简单图的色数,从而证明了计算Fuzzy矩阵的Schein秩是一个"NP-完全问题".     

图的（k，d）-着色问题的一个近似算法

本文讨论了图的(k,d)-着色问题的算法,并给出了一个由四层神经元组成的神经网络算法.当一个图的循环色数已知时(不妨设为k/d),可以利用该算法成功地求出这个图的一个可行(k,d)-着色方案;当一个图的循环色数未知时,可以利用该算法求出这个图的循环色数的近似值.     

逻辑矩阵的特征向量及应用

特征值与特征向量描述了线性变换的基本性质.特征向量是线性变换的作用下保持方向不变的向量,特征值体现了特征向量在线性变换中的伸缩性.讨论了一类布尔矩阵在布尔空间中的特征值与特征向量问题,证明了逻辑矩阵只有1特征值,所有1特征值构成1特征子空间,并且1特征子空间由唯一的一组基本特征向量布尔生成.最后,将逻辑矩阵特征向量的相关结果用于研究布尔网络极限环个数等拓扑性质.     

布尔矩阵的振荡条件与振荡指数

首先将常用类型的模糊矩阵都纳入到了二阶占优模糊矩阵的统一框架之内,然后利用模糊矩阵的有向伴随图,指出了强连通布尔矩阵振荡的一个充要条件,依次证明了强连通的二阶占优布尔矩阵的振荡指数为2n-2,非强连通的二阶占优布尔矩阵的振荡指数为3n-4.     

布尔矩阵的指标格(英文)

本文介绍了布尔矩阵的指标格,并讨论了它的性质,得到了从布尔矩阵指标格到一个给定完备格的一个序嵌入映射存在的条件,回答了在什么条件下布尔矩阵的指标格是完全分配格的问题。     

具有时滞的不完全布尔控制网络的最优控制（英文）

本文研究一类具有延迟模式的不完全布尔控制网络的控制问题.通过半张量积将系统转化为经典的布尔控制网络.在此框架下,研究了此系统的可控性和Mayer型最优控制.最后,给出了可控制性的充要条件和Mayer型最优控制的必要条件.其主要贡献是利用矩阵半张量积方法将系统转化为布尔控制网络代数,一定程度上克服了矩阵积维数的限制.     

倒距离矩阵的谱半径(英文)

本文刻画了在分别具有给定点连通度、边连通度、色数和独立数的n阶图中具有最大倒距离矩阵谱半径的图.     

倒距离矩阵的谱半径(英文)北大核心CSCD

本文刻画了在分别具有给定点连通度、边连通度、色数和独立数的n阶图中具有最大倒距离矩阵谱半径的图.     

Linear operators that preserve Boolean rank of Boolean matrices

The Boolean rank of a nonzero m × n Boolean matrix A is the minimum number k such that there exist an m× k Boolean matrix B and a k × n Boolean matrix C such that A = BC. In the previous research L. B. Beasley and N. J. Pullman obtained that a linear operator preserves Boolean rank if and only if it preserves Boolean ranks 1 and 2. In this paper we extend this characterizations of linear operators that preserve the Boolean ranks of Boolean matrices. That is, we obtain that a linear operator preserves Boolean rank if and only if it preserves Boolean ranks 1 and k for some 1 < k ? m.     

Inverses of Boolean matrices

For a Boolean matrix A, a g-inverse of A is a Boolean matrix G satisfying AGA=A, and a Vagner inverse is a g-inverse which in addition satisfies GAG=G. We give algorithms for finding all g-inverses, all Vagner inverses, and all of several other types of inverses including Moore-Penrose inverses. We give a criterion for a Boolean matrix to be regular, and criteria for the various types of inverse to exist. We count the numbers of Boolean matrices having Moore-Penrose and related types of inverses.     

Idempotent Boolean matrices and majorization

We obtain a new structural characterization of idempotent Boolean matrices. This characterization allows us to describe all Boolean matrices that are majorized by a given idempotent. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 1, pp. 11–29, 2007.     

On cofactor expansion of determinants of Boolean matrices

We give necessary and sufficient conditions for cofactor expansibility of determinants along a row or column for Boolean square matrices over an arbitrary Boolean algebra. First of all we define a natural decomposition of an arbitrary Boolean matrix by interior, exterior, and determinate parts. The introduced notions allow us to establish the main result of this paper. It is shown that the formulas of the cofactor expansion along a row (column) of determinants of an arbitrary square Boolean matrix hold if and only if the formulas of the cofactor expansion along the corresponding row (column) hold for determinants of its interior part. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 4, pp. 199–223, 2007.     

Rank one preservers between spaces of Boolean matrices

In this paper, we characterize (i) linear transformations from one space of Boolean matrices to another that send pairs of distinct rank one elements to pairs of distinct rank one elements and (ii) surjective mappings from one space of Boolean matrices to another that send rank one matrices to rank one matrices and preserve order relation in both directions. Both results are proved in a more general setting of tensor products of two Boolean vector spaces of arbitrary dimension.     

Term rank preservers of Boolean matrices

We obtain some characterizations of linear operators that preserve the term rank of Boolean matrices. That is, a linear operator over Boolean matrices preserves the term rank if and only if it preserves the term ranks 1 and k(≠1) if and only if it preserves the term ranks 2 and l(≠2). Other characterizations of term rank preservers are given.     

The primitive Boolean matrices with the second largest scrambling index by Boolean rank

The scrambling index of an n × n primitive Boolean matrix A is the smallest positive integer k such that A ^k (A ^T) ^k = J, where A ^T denotes the transpose of A and J denotes the n×n all ones matrix. For an m×n Boolean matrix M, its Boolean rank b(M) is the smallest positive integer b such that M = AB for some m × b Boolean matrix A and b×n Boolean matrix B. In 2009, M. Akelbek, S. Fital, and J. Shen gave an upper bound on the scrambling index of an n×n primitive matrix M in terms of its Boolean rank b(M), and they also characterized all primitive matrices that achieve the upper bound. In this paper, we characterize primitive Boolean matrices that achieve the second largest scrambling index in terms of their Boolean rank.     

A note on factoring 0-1 matrices

Nonnegative definite 0-1 matrices are shown to have a Cholesky factorization with the factors being 0-1 matrices. Conditions are derived for the existence of a "Cholesky" factorization of symmetric Boolean matrices. This condition is related to the structure of the graph associated with the matrix.     

Primes in the semigroup of Boolean matrices

Let A, B, C be n×n matrices of zeros and ones. Using Boolean addition and multiplication, we say that A is prime if it is not a permutation matrix and if A=BC implies that B or C must be a permutation matrix. Conditions sufficient for a matrix to be prime are provided, and a characterization of primes in terms of a nation of rank is given. Finally, an order property of primes is used to obtain a result on prime factors.