Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

NONNEGATIVITY OF REDUCIBLE SIGN IDEMPOTENT MATRICES

  • Park, Se-Won (Department of Mathematics, SeoNam University) ;
  • Lee, Sang-Gu (Department of Mathematics, SungKyunKwan University) ;
  • Song, Seok-Zuk (Department of Mathematics, Cheju National University)
  • Published : 2000.05.01

⟨ Previous Next ⟩

Abstract

A matrix whose entries consist of the symbols +.- and 0 is called a sign pattern matrix . In 1994 , Eschenbach gave a graph theoretic characterization of irreducible sign idempotent pattern matrices. In this paper, we give a characterization of reducible sign idempotent matrices. We show that reducible sign idempotent matrices, whose digraph is contained in an irreducible sign idempotent matrix, has all nonnegative entries up to equivalences. this extend the previous result.

Keywords

References

  1. Linear Algebra Appl. v.180 Idempotence for sign-pattern matrices C. A. Eschenbach
  2. Linear Algebra Appl. v.211 sign Pattern Matrices and Generalized Inverse C. A. Eschenbach;Frank J. Hall;Zhongshan Li
  3. Linear Algebra Appl. v.107 Combinatorial matrix analysis: An overview C. R. Johnson
  4. SIAM Rev. v.11 Qualitative Problems in matrix theory John S. Maybee;J.Quirk
  5. Selected Topics in Graph Theory Lowell W. Beineke;Robin J. Wilson