𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On biclique coverings

✍ Scribed by Sergei Bezrukov; Dalibor Fronček; Steven J. Rosenberg; Petr Kovář

Book ID
108113767
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
138 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering cliques with spanning bicliques
Covering cliques with spanning bicliques
✍ K�ndgen, Andr� 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

The edges of the complete graph on n vertices can be covered by lg n spanning complete bipartite subgraphs. However, the sum of the number of edges in these subgraphs is roughly (n 2 /4)lg n, while a cover consisting of n -1 spanning stars uses only (n -1) 2 edges. We will show that the covering by

Biclique graphs and biclique matrices
Biclique graphs and biclique matrices
✍ Marina Groshaus; Jayme L. Szwarcfiter 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB

## Abstract A biclique of a graph __G__ is a maximal induced complete bipartite subgraph of __G__. Given a graph __G__, the biclique matrix of __G__ is a {0,1,−1} matrix having one row for each biclique and one column for each vertex of __G__, and such that a pair of 1, −1 entries in a same row cor

On cliques and bicliques
On cliques and bicliques
✍ Henning, Michael A. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 1 views

For integers m, n ≥ 2, let g(m, n) be the minimum order of a graph, where every vertex belongs to both a clique K m of order m and a biclique K(n, n). or, if m is sufficiently large and (m -1)(n -1) is not an integer.

On the Iterated Biclique Operator
On the Iterated Biclique Operator
✍ Marina Groshaus; Leandro P. Montero 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 605 KB