Inertia and biclique decompositions of joins of graphs

DOI10.1016/S0095-8956(02)00041-2zbMath1025.05042OpenAlexW2053364672MaRDI QIDQ1405108

Kevin N. Vander Meulen, David A. Gregory, Brenda Heyink

Publication date: 25 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(02)00041-2

zbMATH Keywords

Hermitian matriceseigenvaluesinertiabicliquesjoinsgraph decompositions

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (16)

New inequalities for network distance measures by using graph spectra ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The extremal problems on the inertia of weighted bicyclic graphs ⋮ Inertia of complex unit gain graphs ⋮ Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra ⋮ Solutions to 18 constrained optimization problems on the rank and inertia of the linear matrix function ⋮ The consistency and the exact solutions to a system of matrix equations ⋮ Bicyclic graphs with small positive index of inertia ⋮ Maximization and minimization of the rank and inertia of the Hermitian matrix expression \(A-BX-(BX)^{*}\) with applications ⋮ The inertia of weighted unicyclic graphs ⋮ A survey on rank and inertia optimization problems of the matrix-valued function \(A+BXB^\ast\) ⋮ Equalities and inequalities for inertias of Hermitian matrices with applications ⋮ Eigenvalues and clique partitions of graphs ⋮ The smallest positive eigenvalue of graphs under perturbation ⋮ On decompositions of complete hypergraphs

Cites Work

• A table of connected graphs on six vertices
• Biclique decompositions and Hermitian rank
• Decompositions of complete multigraphs related to Hadamard matrices
• A tree whose complement is not eigensharp
• Eigenvalues and partitionings of the edges of a graph
• Matrix Analysis
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
• On the Addressing Problem for Loop Switching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inertia and biclique decompositions of joins of graphs