Orthogonal representations, minimum rank, and graph complements

DOI10.1016/J.LAA.2007.12.004MaRDI QIDQ924328zbMATH OpenOpenAlexFDO

Authors Leslie Hogben

Publication date 15 May 2008

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

Full work available at URL https://lib.dr.iastate.edu/math_pubs/87

zbMATH Keywords

unicyclic graphminimum rank2-treegraph complementorthogonal representation

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)

Recommendations

• Subgraph complementation and minimum rank
• Minimum vector rank and complement critical graphs
• On the graph complement conjecture for minimum rank
• The minimum semidefinite rank of the complement of partial \(k\)-trees
• Zero forcing sets and the minimum rank of graphs

Cites work

• Computation of minimal rank and path cover number for certain graphs
• Forbidden minors for the class of graphs G with (G) 2
• Graphs whose minimal rank is two
• Graphs whose positive semi-definite matrices have nullity at most two
• Linearly independent vertices and minimum semidefinite rank
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• On the minimum semidefinite rank of a simple graph
• The minimum rank of symmetric matrices described by a graph: a survey
• Unitary matrix digraphs and minimum semidefinite rank
• Zero forcing sets and the minimum rank of graphs

Cited in

(17)

• Minimum vector rank and complement critical graphs
• Graphs associated with vector spaces of even dimension: A link with differential geometry
• On the graph complement conjecture for minimum rank
• Graph complement conjecture for classes of shadow graphs
• The minimum semidefinite rank of a triangle-free graph
• The minimum semidefinite rank of the complement of partial \(k\)-trees
• The inverse inertia problem for the complements of partial \(k\)-trees
• Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
• Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
• On the ideal of orthogonal representations of a graph in \(\mathbb{R}^2\)
• On minimum rank and zero forcing sets of a graph
• Subgraph complementation and minimum rank
• On the minimum semidefinite rank of a simple graph
• On the zero forcing number of the complement of graphs with forbidden subgraphs
• scientific article; zbMATH DE number 7692355 (Why is no real title available?)
• On extremal graphs for zero forcing number
• A new graph parameter related to bounded rank positive semidefinite matrix completions

This page was built for publication: Orthogonal representations, minimum rank, and graph complements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924328)