A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs

From MaRDI portal
Publication:5469425

DOI10.13001/1081-3810.1170zbMath1092.05042OpenAlexW2123373547MaRDI QIDQ5469425

Shaun M. Fallat, Francesco Barioli, Leslie Hogben

Publication date: 18 May 2006

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/126227




Related Items (27)

Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graphThe inverse inertia problem for graphs: Cut vertices, trees, and a counterexampleUsing a new zero forcing process to guarantee the strong Arnold propertyThe inertia set of a signed graphComputational and Theoretical Challenges for Computing the Minimum Rank of a GraphMinimum rank and maximum eigenvalue multiplicity of symmetric tree sign patternsTechniques for determining equality of the maximum nullity and the zero forcing number of a graphThe strong spectral property for graphsForbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)Optimizing Colin de Verdière matrices of \(K_{4,4}\)Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graphOn the graph complement conjecture for minimum rankComputing inertia sets using atomsThe minimum semidefinite rank of the complement of partial \(k\)-treesThe liberation set in the inverse eigenvalue problem of a graphSigned graphs with maximum nullity twoOn the Colin de Verdière number of graphsThree-connected graphs whose maximum nullity is at most threeTwo-connected signed graphs with maximum nullity at most twoThe minimum rank of matrices and the equivalence class graphThe inverse eigenvalue problem of a graph: multiplicities and minorsParameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a GraphZero forcing sets and the minimum rank of graphsExpected values of parameters associated with the minimum rank of a graphSigned graphs with stable maximum nullity at most twoThe minimum rank of symmetric matrices described by a graph: a surveyOn the Colin de Verdière numbers of Cartesian graph products




This page was built for publication: A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs