Title of article :
How Sparse Can a Matrix with Orthogonal Rows Be?
Author/Authors :
Cheon، نويسنده , , Gi-Sang and Shader، نويسنده , , Bryan L، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Abstract :
The least number of nonzero entries among thembynconnected, row-orthogonal matrices is determined. In addition, the zero patterns of the matrices for which equality holds are characterized.
Journal title :
Journal of Combinatorial Theory Series A
Journal title :
Journal of Combinatorial Theory Series A
