The inverse inertia problem for the complements of partial \(k\)-trees (Q2435477): Difference between revisions

@@ Property / cites work @@
+The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
+Normal rank
@@ Property / cites work @@
+The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
+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 @@
+Graphs whose minimal rank is two: The finite fields case
+Normal rank
@@ Property / cites work @@
+Zero forcing sets and the minimum rank of graphs
@@ Property / cites work: Zero forcing sets and the minimum rank of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Orthogonal representations, minimum rank, and graph complements
+Normal rank
@@ Property / cites work @@
+The minimum semidefinite rank of the complement of partial \(k\)-trees
+Normal rank
@@ Property / cites work @@
+The minimum rank of symmetric matrices described by a graph: a survey
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3160258
@@ Property / cites work: Q3160258 / rank @@
+Normal rank