Bounds on the base of primitive sign pattern matrices with two simple cycles

被引：0
|
作者：
Hu Hongping [1 ]
Gao Yubin [1 ]
Wang Hanzhong [1 ]
Yang Zhengmin [1 ]
机构：
[1] N Univ China, Dept Math, Taiyuan 030051, Peoples R China
来源：
ISTM/2007: 7TH INTERNATIONAL SYMPOSIUM ON TEST AND MEASUREMENT, VOLS 1-7, CONFERENCE PROCEEDINGS | 2007年
关键词：
base; matrix; sign pattern; primitive; bound; digraph;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A sign pattern matrix is the matrix whose entries come from the set {+, -, 0). For A is an element of Q(n), there exist the associated digraph D(A) and the associated signed digraph S(A). In this paper, we study the bounds on the base of primitive non-powerful digraphs with two simple ycles. We obtain lower bounds, together with characterization of the equality cases of the base for primitive digraphs.
引用
收藏
页码：6115 / 6118
页数：4
相关论文
共 50 条
12345