Biclique decompositions and Hermitian rank (Q1124868)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Biclique decompositions and Hermitian rank |
scientific article; zbMATH DE number 1371372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Biclique decompositions and Hermitian rank |
scientific article; zbMATH DE number 1371372 |
Statements
Biclique decompositions and Hermitian rank (English)
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
0.7789075970649719
0 references
0.7747507095336914
0 references
0.745791494846344
0 references
