๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bounds on the base of primitive nearly reducible sign pattern matrices

โœ Scribed by Bolian Liu; Lihua You

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
304 KB
Volume
418
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The base sets of primitive zero-symmetri
The base sets of primitive zero-symmetric sign pattern matrices
โœ Bo Cheng; Bolian Liu ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 240 KB

In [J.Y. Shao, L.H. You, Bound on the base of irreducible generalized sign pattern matrices, Discrete Math., in press], Shao and You extended the concept of the base from powerful sign pattern matrices to non-powerful (and generalized) sign pattern matrices. In this paper, we study the bases of prim

The base sets of quasi-primitive zero-sy
The base sets of quasi-primitive zero-symmetric sign pattern matrices with zero trace
โœ Shiying Wang; Jing Li; Wei Han; Shangwei Lin ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

The base sets of primitive zero-symmetric sign pattern matrices, Linear Algebra Appl. 428 (2008) [715][716][717][718][719][720][721][722][723][724][725][726][727][728][729][730][731] showed that the base set of quasi-primitive zerosymmetric (generalized) sign pattern matrices is {1, 2, . . . , 2n}.

On the sign pattern of network matrices
On the sign pattern of network matrices
โœ David P. Brown; Myril B. Reed ๐Ÿ“‚ Article ๐Ÿ“… 1962 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 426 KB

Any synthesis process based on a node-pair or mesh matrix must take cognizance of the sign pattern of the matrix. It is proved in general terms in this paper that: (1) the only subgraph of a connected graph G wbich need be of concern in studying the sign pattern of the node-pair (mesh) matrix is th