Zero forcing sets and the minimum rank of graphs
Publication:2477541
DOI10.1016/j.laa.2007.10.009zbMath1135.05035MaRDI QIDQ2477541
Shaun M. Fallat, Willem H. Haemers, Leslie Hogben, Irene Sciriha, Dragan Stevanović, Francesco Barioli, Steve Butler, Sivaram K. Narayan, Sebastian M. Cioabă, Hein van der Holst, Kevin N. Vander Meulen, Wayne W. Barrett, Olga Pryporova, Chris D. Godsil, Rana Mikkelson, Amy Wangsness Wehe, Wa-Sin So, Dragos Cvetković
Publication date: 14 March 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1103&context=math_pubs
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
15A03: Vector spaces, linear dependence, rank, lineability
Related Items
Cites Work
- Unnamed Item
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
- Three-connected graphs whose maximum nullity is at most three
- The minimum rank of symmetric matrices described by a graph: a survey
- The minimum rank problem over the finite field of order 2: Minimum rank 3
- Inverse eigenvalue problems for Jacobi matrices
- Computation of minimal rank and path cover number for certain graphs
- Minimum rank of a graph over an arbitrary field
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Graphs whose minimal rank is two
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs