Bounds for minimum semidefinite rank from superpositions and cutsets (Q389675): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Zero forcing parameters and minimum rank problems / 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 semidefinite rank of a simple graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / 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: Zero forcing sets and the minimum rank of graphs / 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: Lower bounds in minimum rank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector representations of graphs / 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: On the maximum positive semi-definite nullity and the cycle matroid of graphs / rank
 
Normal rank

Revision as of 05:53, 7 July 2024

scientific article
Language Label Description Also known as
English
Bounds for minimum semidefinite rank from superpositions and cutsets
scientific article

    Statements

    Bounds for minimum semidefinite rank from superpositions and cutsets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 January 2014
    0 references
    minimum semidefinite rank
    0 references
    vector representation of a graph
    0 references
    superposition of graphs
    0 references
    cutsets
    0 references

    Identifiers