Bicliques and eigenvalues

DOI10.1006/JCTB.2000.2020zbMath1028.05066OpenAlexW2169003003MaRDI QIDQ1850533

Willem H. Haemers

Publication date: 10 December 2002

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

Full work available at URL: https://semanticscholar.org/paper/9a97c2ab8bf53046e58a5d658b03808ba4209fad

zbMATH Keywords

matrix representationsproduct graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (12)

On the iterated edge-biclique operator ⋮ Tighter bounds on the independence number of the Birkhoff graph ⋮ Unnamed Item ⋮ Biclique graphs of interval bigraphs ⋮ On the edge‐biclique graph and the iterated edge‐biclique operator ⋮ On some conjectures on biclique graphs ⋮ Almost every graph is divergent under the biclique operator ⋮ The maximum edge biclique problem is NP-complete ⋮ Unnamed Item ⋮ A notion of cross-perfect bipartite graphs ⋮ Lovász theta approach to eventown problem ⋮ Lovász theta type norms and operator systems

Cites Work

• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• Disconnected vertex sets and equidistant code pairs
• Interlacing eigenvalues and graphs
• Matrix Analysis
• Combinatorial matrix theory
• On the Shannon capacity of a graph

This page was built for publication: Bicliques and eigenvalues