Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1515/spma-2019-0022 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1515/SPMA-2019-0022 / rank | |||
Normal rank | |||
Latest revision as of 21:57, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Achievable multiplicity partitions in the inverse eigenvalue problem of a graph |
scientific article |
Statements
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (English)
0 references
26 February 2020
0 references
inverse eigenvalue problem
0 references
multiplicity partition
0 references
adjacency matrix
0 references
minimum rank
0 references
distinct eigenvalues
0 references
graphs
0 references
0 references
0 references
0 references
