Biclique decompositions and Hermitian rank
From MaRDI portal
Publication:1124868
DOI10.1016/S0024-3795(99)00042-7zbMath0929.05056MaRDI QIDQ1124868
Valerie L. Watts, Bryan L. Shader, David A. Gregory
Publication date: 29 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (23)
Addressing the Petersen graph ⋮ An overview of graph covering and partitioning ⋮ 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 ⋮ On a symmetric representation of Hermitian matrices and its applications to graph theory ⋮ Bicyclic graphs with small positive index of inertia ⋮ Inertia and biclique decompositions of joins of graphs ⋮ The inertia of weighted unicyclic graphs ⋮ Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method ⋮ A tree whose complement is not eigensharp ⋮ Wiener index and addressing of the total graph ⋮ On eigensharp and almost eigensharp graphs ⋮ Equalities and inequalities for inertias of Hermitian matrices with applications ⋮ Addressing graph products and distance-regular graphs ⋮ Unnamed Item ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ Eigenvalues and clique partitions of graphs ⋮ 2004 Summer Meeting of the Association for Symbolic Logic ⋮ Efficient edge domination in regular graphs ⋮ Unnamed Item
This page was built for publication: Biclique decompositions and Hermitian rank