Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns. (English) Zbl 1106.05059
Summary: 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.
MSC:
| 05C50 | Graphs and linear algebra (matrices, eigenvalues, etc.) |
| 15A18 | Eigenvalues, singular values, and eigenvectors |
| 05C05 | Trees |
| 05C85 | Graph algorithms (graph-theoretic aspects) |
References:
| [1] | Barioli, F.; Fallat, S.; Hogben, L., Computation of minimal rank and path cover number for graphs, Linear Algebra Appl., 392, 289-303 (2004) · Zbl 1052.05045 |
| [2] | Barioli, F.; Fallat, S.; Hogben, L., On the difference between the maximum multiplicity and path cover number for tree-like graphs, Linear Algebra Appl., 13, 387-404 (2005) · Zbl 1092.05042 |
| [3] | Barrett, W. W.; van der Holst, H.; Loewy, R., Graphs whose minimal rank is two, Electron. J. Linear Algebra, 11, 258-280 (2004) · Zbl 1070.05059 |
| [4] | Brualdi, R.; Shader, B., Matrices of Sign-Solvable Linear Systems (1995), Cambridge University Press: Cambridge University Press Cambridge · Zbl 0833.15002 |
| [5] | Chen, G.; Hall, F. J.; Li, Z.; Wei, B., On ranks of matrices associated with trees, Graphs Combin., 19, 3, 323-334 (2003) · Zbl 1023.05093 |
| [6] | Eschenbach, C. A.; Johnson, C. R., Sign patterns that require repeated eigenvalues, Linear Algebra Appl., 190, 169-179 (1993) · Zbl 0795.15008 |
| [7] | F.J. Hall, Z. Li, Sign Pattern Matrices, Handbook of Linear Algebra, CRC Press, Boca Raton, 2006, in press.; F.J. Hall, Z. Li, Sign Pattern Matrices, Handbook of Linear Algebra, CRC Press, Boca Raton, 2006, in press. |
| [8] | Hall, F. J.; Li, Z.; Wang, D., Symmetric sign pattern matrices that require unique inertia, Linear Algebra Appl., 338, 153-169 (2001) · Zbl 0994.15028 |
| [9] | Hershkowitz, D.; Schneider, H., Ranks of zero patterns and sign patterns, Linear and Multilinear Algebra, 34, 3-19 (1993) · Zbl 0793.05027 |
| [10] | Horn, R.; Johnson, C. R., Matrix Analysis (1985), Cambridge University Press: Cambridge University Press Cambridge · Zbl 0576.15001 |
| [11] | Johnson, C. R.; Leal Duarte, A., The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, Linear and Multilinear Algebra, 46, 139-144 (1999) · Zbl 0929.15005 |
| [12] | Johnson, C. R.; Leal Duarte, A.; Saiago, C. M., The Parter-Wiener theorem: refinement and generalization, SIAM J. Matrix Anal. Appl., 25, 311-330 (2003) · Zbl 1067.15003 |
| [13] | Johnson, C. R.; Saiago, C. M., Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of the matrix, Electron. J. Linear Algebra, 9, 27-31 (2002) · Zbl 0999.15005 |
| [14] | Li, Z.; Harris, L., Sign patterns that require all distinct eigenvalues, JP J. Algebra Number Theory Appl., 2, 161-179 (2002) · Zbl 1030.15009 |
| [15] | Parter, S., On the eigenvalues and eigenvectors of a class of matrices, J. Soc. Indust. Appl. Math., 8, 376-388 (1960) · Zbl 0115.24804 |
| [16] | Wiener, G., Spectral multiplicity and splitting results for a class of qualitative matrices, Linear Algebra Appl., 61, 15-29 (1984) · Zbl 0549.15004 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
