Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues (Q2250939): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Linearly independent vertices and minimum semidefinite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parter--Wiener Theorem: Refinement and Generalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix / rank
 
Normal rank

Revision as of 18:27, 8 July 2024

scientific article
Language Label Description Also known as
English
Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references