Biclique decompositions and Hermitian rank (Q1124868): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q209029
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: David A. Gregory / rank
 
Normal rank

Revision as of 03:11, 11 February 2024

scientific article
Language Label Description Also known as
English
Biclique decompositions and Hermitian rank
scientific article

    Statements

    Biclique decompositions and Hermitian rank (English)
    0 references
    0 references
    0 references
    0 references
    29 November 1999
    0 references
    The Hermitian rank of a Hermitian matrix \(H\) is defined and shown to be equal to the maximum of the numbers of positive and negative eigenvalues of \(H\). The minimum number of complete bipartite subgraphs needed to partition the edge set of a graph is obtained.
    0 references
    decompositions
    0 references
    bicliques
    0 references
    Hermitian rank
    0 references
    Hermitian matrix
    0 references
    partition
    0 references

    Identifiers