Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q126589107, #quickstatements; #temporary_batch_1719272490319 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126589107 / rank | |||
Normal rank | |||
Revision as of 00:49, 25 June 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
