Unitary matrix digraphs and minimum semidefinite rank
From MaRDI portal
Publication:2477544
Recommendations
Cites work
- scientific article; zbMATH DE number 510850 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- A survey of graph laplacians
- Combinatorially orthogonal matrices and related graphs
- Graphs whose positive semi-definite matrices have nullity at most two
- Linearly independent vertices and minimum semidefinite rank
- Minimum-rank matrices with prescribed graph
- On the Digraph of a Unitary Matrix
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- On the minimum semidefinite rank of a simple graph
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- Quadrangularity and strong quadrangularity in tournaments
- Sparsity of orthogonal matrices with restrictions
- The possible numbers of zeros in a orthogonal matrix
Cited in
(13)- Linearly independent vertices and minimum semidefinite rank
- Bounds on minimum semidefinite rank of graphs
- Graphs of unitary matrices and positive semidefinite zero forcing
- A note on universally optimal matrices and field independence of the minimum rank of a graph
- The minimum semidefinite rank of a triangle-free graph
- Orthogonal representations, minimum rank, and graph complements
- On the minimum semidefinite rank of a simple graph
- scientific article; zbMATH DE number 7640506 (Why is no real title available?)
- The minimum rank of symmetric matrices described by a graph: a survey
- Orthogonal representations of Steiner triple system incidence graphs
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- Graphs of unitary matrices
- On the Digraph of a Unitary Matrix
This page was built for publication: Unitary matrix digraphs and minimum semidefinite rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477544)