Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Timothy L. Hardy"'
Publikováno v:
Linear Algebra and its Applications. 418:394-415
The set of real matrices described by a sign pattern (a matrix whose entries are elements of {+, −, 0}) has been studied extensively but only loose bounds were available for the minimum rank of a tree sign pattern. A simple graph has been associate
Publikováno v:
The Electronic Journal of Linear Algebra. 10
In this paper it is shown that a partialsign symmetric P -matrix, whose digraph of specified entries is a symmetric n-cycle with n ≥ 6, can be completed to a sign symmetric P - matrix. The analogous completion property is also established for a par