The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
In the study of eigenvalues, multiplicities, and graphs, the minimum number of multiplicities equal to 1 in a real symmetric matrix with graph G, U(G), is an important constraint on the possible multiplicity lists among matrices in 𝒮(G). Of course, the structure of G must determine U(G), but, even f...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2021-12-01
|
| Series: | Special Matrices |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/spma-2021-0158 |