Inertia and biclique decompositions of joins of graphs (Q1405108)
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: Inertia and biclique decompositions of joins of graphs |
scientific article; zbMATH DE number 1970682
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inertia and biclique decompositions of joins of graphs |
scientific article; zbMATH DE number 1970682 |
Statements
Inertia and biclique decompositions of joins of graphs (English)
0 references
25 August 2003
0 references
The authors characterize the inertia of \(A+B\) for Hermitian matrices \(A\) and \(B\) when the rank of \(B\) is one. Using this, the inertia of a partial join of two graphs has been characterized. The authors further provide graph joins \(G\) for which the minimum number of complete bipartite graphs needed in a partition of the edge multiset of \(G\) is equal to the maximum of the number of positive and negative eigenvalues of \(G\).
0 references
graph decompositions
0 references
bicliques
0 references
joins
0 references
eigenvalues
0 references
inertia
0 references
Hermitian matrices
0 references
