Bounds on the Base of Primitive Sign Pattern Matrices with Two Simple Cycles
A sign pattern matrix is the matrix whose entries come from the set +,-,0. For, n A Q ∈ , 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.
Base Matrix Sign pattern Primitive Bound Digraph1
HU Hongping GAO Yubin WANG Jianzhong YANG Zhengmin
Department of Mathematics, North University of China, Taiyuan, 030051
国际会议
北京
英文
2007-08-05(万方平台首次上网日期,不代表论文的发表时间)