The minimum semidefinite rank of a triangle-free graph

DOI10.1016/j.laa.2010.11.052zbMath1216.05073OpenAlexW2072023487MaRDI QIDQ630548

Louis Deaett

Publication date: 17 March 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.11.052

zbMATH Keywords

triangle-free graphminimum rank problemminimum semidefinite rankpotentially unitary patternunitary digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items

Almost orthogonal subsets of vector spaces over finite fields ⋮ Orthogonal representations of Steiner triple system incidence graphs ⋮ Almost-equidistant sets ⋮ Sets with many pairs of orthogonal vectors over finite fields ⋮ The minimum semidefinite rank of a triangle-free graph ⋮ Orthonormal representations of \(H\)-free graphs ⋮ On almost-equidistant sets ⋮ Bounds on the connected forcing number of a graph ⋮ Bounding the Size of an Almost-Equidistant Set in Euclidean Space ⋮ On Orthogonal Matrices with Zero Diagonal ⋮ Maximum nullity and zero forcing number on graphs with maximum degree at most three

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds for minimum semidefinite rank from superpositions and cutsets
• The minimum semidefinite rank of a triangle-free graph
• Cycles of nonzero elements in low rank matrices
• Linearly independent vertices and minimum semidefinite rank
• Orthogonal representations, minimum rank, and graph complements
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• Laplacian matrices of graphs: A survey
• Small Ramsey numbers
• Graphs whose positive semi-definite matrices have nullity at most two
• Multiplicities of eigenvalues and tree-width of graphs
• Matrix rigidity
• Matrix rank and communication complexity
• Unitary matrix digraphs and minimum semidefinite rank
• A counterexample to the rank-coloring conjecture
• Cages—a survey
• The possible numbers of zeros in a orthogonal matrix
• Handbook of Graph Theory
• On the Digraph of a Unitary Matrix
• Quantum walks on graphs

This page was built for publication: The minimum semidefinite rank of a triangle-free graph