Inertia and biclique decompositions of joins of graphs
type: Item
instance of: scholarly article
title: Inertia and biclique decompositions of joins of graphs
zbMATH Open document ID: 1025.05042
DOI: 10.1016/S0095-8956(02)00041-2
author: D. A. Gregory
author: Brenda Heyink
author: Kevin N. Vander Meulen
published in: Journal of Combinatorial Theory. Series B
publication date: 2003-08-25T00:00:00Z
review text: 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\).
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1970682
zbMATH Keywords: graph decompositions
zbMATH Keywords: bicliques
zbMATH Keywords: joins
zbMATH Keywords: eigenvalues
zbMATH Keywords: inertia
zbMATH Keywords: Hermitian matrices
reviewed by: Bai Kishan Dass
MaRDI profile type: Publication
cites work: A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
cites work: A table of connected graphs on six vertices
cites work: Q3136986
cites work: Q2716030
cites work: On the Addressing Problem for Loop Switching
cites work: Biclique decompositions and Hermitian rank
cites work: Decompositions of complete multigraphs related to Hadamard matrices
cites work: Eigenvalues and partitionings of the edges of a graph
cites work: Matrix Analysis
cites work: Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
cites work: Q4846548
cites work: Q4050723
cites work: Q4152571
cites work: A tree whose complement is not eigensharp
full work available at URL: s0095-8956(02)00041-2
OpenAlex ID: W2053364672
description: scientific article; zbMATH DE number 1970682