A note on universally optimal matrices and field independence of the minimum rank of a graph (Q977476): 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: On the minimum rank of not necessarily symmetric matrices: A preliminary study / 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: A new 5‐arc‐transitive cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3559048 / 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: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-rank matrices with prescribed graph / rank
 
Normal rank

Latest revision as of 23:12, 2 July 2024

scientific article
Language Label Description Also known as
English
A note on universally optimal matrices and field independence of the minimum rank of a graph
scientific article

    Statements

    A note on universally optimal matrices and field independence of the minimum rank of a graph (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2010
    0 references
    0 references
    minimum rank
    0 references
    universally optimal matrix
    0 references
    field independent
    0 references
    maximum nullity
    0 references
    symmetric matrix
    0 references
    rank
    0 references
    graph
    0 references
    matrix
    0 references
    0 references