Maximum generic nullity of a graph

DOI10.1016/j.laa.2009.09.025zbMath1185.05098OpenAlexW1983451866MaRDI QIDQ846315

Leslie Hogben, Bryan L. Shader

Publication date: 9 February 2010

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=1079&context=math_pubs

zbMATH Keywords

graphranksymmetric matrixnullityminimum rankmaximum nullitycorankorthogonal representationmaximum corankmaximum generic nullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (1)

Sparks of symmetric matrices and their graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Three-connected graphs whose maximum nullity is at most three
• An upper bound for the minimum rank of a graph
• Expected values of parameters associated with the minimum rank of a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• A correction: Orthogonal representations and connectivity of graphs
• Orthogonal representations and connectivity of graphs
• On the Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: Maximum generic nullity of a graph