Title of article
Inertia and biclique decompositions of joins of graphs
Author/Authors
Gregory، نويسنده , , David A and Heyink، نويسنده , , Brenda and Meulen، نويسنده , , Kevin N. Vander Meulen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
17
From page
135
To page
151
Abstract
We characterize the inertia of A+B for Hermitian matrices A and B when the rank of B is one. We use this to characterize the inertia of a partial join of two graphs. We then provide graph joins G for which the minimum number of complete bipartite graphs needed in a partition of the edge multi-set of G is equal to the maximum of the number of positive and negative eigenvalues of G.
Keywords
inertia , Graph decompositions , Bicliques , Joins , eigenvalues
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series B
Record number
1527224
Link To Document