Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph'' (Q2217786): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1515/spma-2020-0117
+Normal rank
@@ Property / OpenAlex ID @@
+W3110225681
@@ Property / OpenAlex ID: W3110225681 / rank @@
+Normal rank
@@ Property / cites work @@
+Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
+Normal rank
@@ Property / cites work @@
+Minimum number of distinct eigenvalues of graphs
@@ Property / cites work: Minimum number of distinct eigenvalues of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The inverse eigenvalue problem of a graph: multiplicities and minors
+Normal rank
@@ Property / cites work @@
+Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
+Normal rank
@@ Property / cites work @@
+The inertia set of the join of graphs
@@ Property / cites work: The inertia set of the join of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs whose minimal rank is two
@@ Property / cites work: Graphs whose minimal rank is two / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
+Normal rank
@@ Property / cites work @@
+The minimum rank of symmetric matrices described by a graph: a survey
+Normal rank
@@ Property / cites work @@
+Smith normal form and acyclic matrices
@@ Property / cites work: Smith normal form and acyclic matrices / rank @@
+Normal rank
@@ Property / cites work @@
+A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
+Normal rank
@@ Property / cites work @@
+Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
+Normal rank
@@ Property / cites work @@
+The nowhere-zero eigenbasis problem for a graph
@@ Property / cites work: The nowhere-zero eigenbasis problem for a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs that allow all the eigenvalue multiplicities to be even
+Normal rank
@@ Property / cites work @@
+The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
+Normal rank
@@ Property / cites work @@
+Positive semidefinite maximum nullity and zero forcing number
+Normal rank