Sparsity of graphs that allow two distinct eigenvalues (Q6173926): Difference between revisions

@@ 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 @@
+Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
+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 @@
+Q4281318
@@ Property / cites work: Q4281318 / 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 @@
+Kronecker products of fully indecomposable matrices and of ultrastrong digraphs
+Normal rank
@@ Property / cites work @@
+Combinatorially orthogonal matrices and related graphs
+Normal rank
@@ Property / cites work @@
+Edge sets contained in circuits
@@ Property / cites work: Edge sets contained in circuits / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6173926