Graphs whose positive semi-definite matrices have nullity at most two
From MaRDI portal
Publication:1414690
DOI10.1016/S0024-3795(03)00642-6zbMath1029.05099MaRDI QIDQ1414690
Publication date: 4 December 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items (21)
Linearly independent vertices and minimum semidefinite rank ⋮ The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample ⋮ Unnamed Item ⋮ Orthogonal representations of Steiner triple system incidence graphs ⋮ Bounds for minimum semidefinite rank from superpositions and cutsets ⋮ On the graph complement conjecture for minimum rank ⋮ The minimum semidefinite rank of a triangle-free graph ⋮ Positive semidefinite zero forcing ⋮ Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs ⋮ Orthogonal representations, minimum rank, and graph complements ⋮ On the minimum semidefinite rank of a simple graph ⋮ Frame graph ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ Unitary matrix digraphs and minimum semidefinite rank ⋮ Bounds on minimum semidefinite rank of graphs ⋮ Zero forcing parameters and minimum rank problems ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ The minimum rank problem for circulants ⋮ The graphs for which the maximum multiplicity of an eigenvalue is two ⋮ Unnamed Item ⋮ Graph complement conjecture for classes of shadow graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sur la multiplicité de la premiere valeur propre des surfaces riemanniennes
- Inertia characteristics of self-adjoint matrix polynomials
- Eigenfunctions and nodal sets
- Some geometric aspects of graphs and their eigenfunctions
- Multiplicities of eigenvalues and tree-width of graphs
- Spectral characterization of tree-width-two graphs
This page was built for publication: Graphs whose positive semi-definite matrices have nullity at most two
