Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns

Citations of this article
Mendeley users who have this article in their library.


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 associated with the set of symmetric matrices having a zero-nonzero pattern of off-diagonal entries described by the graph, and the minimum rank/maximum eigenvalue multiplicity among matrices in this set is readily computable for a tree. In this paper, we extend techniques for trees to tree sign patterns and trees allowing loops (with the presence or absence of loops describing the zero-nonzero pattern of the diagonal), allowing precise computation of the minimum rank of a tree sign pattern and a tree allowing loops. For a symmetric tree sign pattern or a tree that allows loops, we provide an algorithm that allows exact computation of maximum multiplicity and minimum rank, and can be used to obtain a symmetric integer matrix realizing minimum rank. © 2006 Elsevier Inc. All rights reserved.




DeAlba, L. M., Hardy, T. L., Hentzel, I. R., Hogben, L., & Wangsness, A. (2006). Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns. Linear Algebra and Its Applications, 418(2–3), 394–415.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free