Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Associated to a graph G is a set (G) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen. If G has n vertices, then the multiplicities of the eigenvalues of a...
Kaydedildi:
| Asıl Yazarlar: | , , , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
De Gruyter
2019-12-01
|
| Seri Bilgileri: | Special Matrices |
| Konular: | |
| Online Erişim: | https://doi.org/10.1515/spma-2019-0022 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|