Converse to the Parter--Wiener theorem: the case of non-trees (Q856860): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.04.025 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2057096223 / rank | |||
Normal rank |
Revision as of 18:19, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Converse to the Parter--Wiener theorem: the case of non-trees |
scientific article |
Statements
Converse to the Parter--Wiener theorem: the case of non-trees (English)
0 references
14 December 2006
0 references
Let \(A(i)\) denote the matrix obtained by deleting the \(i\)th row and column of the matrix \(A\), and let \(m_A(\lambda )\) be the multiplicity of the eigenvalue \(\lambda\) of \(A\). The Parter--Wiener theorem, as extended by the authors and \textit{C.\ M.\ Saiago} [SIAM J.\ Matrix Anal.\ Appl.\ 25, 352--361 (2003; Zbl 1067.15003)], asserts that if the graph of a Hermitian matrix \(A\) is a tree and, for some index \(j\), \(\lambda \in \sigma (A)\cap \sigma (A(j))\), then there is an index \(i\) such that \(m_{A(i)}(\lambda )=m_A(\lambda )+1\). The authors prove that this result is generally true only for trees.
0 references
matrix graph
0 references
eigenvalue multiplicity
0 references