Orthogonal representations, minimum rank, and graph complements (Q924328): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of minimal rank and path cover number for certain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between the maximum multiplicity and path cover number for tree-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose minimal rank is two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum semidefinite rank of a simple graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum rank of symmetric matrices described by a graph: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly independent vertices and minimum semidefinite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose positive semi-definite matrices have nullity at most two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unitary matrix digraphs and minimum semidefinite rank / rank
 
Normal rank

Revision as of 09:03, 28 June 2024

scientific article
Language Label Description Also known as
English
Orthogonal representations, minimum rank, and graph complements
scientific article

    Statements

    Identifiers