Biclique graphs and biclique matrices
A biclique of a graph G is a maximal induced complete bipar tite 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 corresponds exactly to adjacent ve...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/68007 |
| Acceso en línea: | http://hdl.handle.net/11336/68007 |
| Access Level: | acceso abierto |
| Palabra clave: | Biclique Graphs Bicliques Bipartite Matrices Clique Graphs Cliques https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Sumario: | A biclique of a graph G is a maximal induced complete bipar tite 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 corresponds exactly to adjacent vertices in the corresponding biclique. We describe a characterization of biclique matrices, in similar terms as those employed in Gilmore's characterization of clique matrices. On the other hand, the biclique graph of a graph is the intersection graph of the bicliques of G. Using the concept of biclique matrices, we describe a Krausz-type char acterization of biclique graphs. Finally, we show that every induced P3 of a biclique graph must be included in a diamond or in a 3-fan and we also characterize biclique graphs of bipartite graphs. |
|---|