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...
Guardado en:
| Autores principales: | Groshaus, M., Szwarcfiter, J.L. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03649024_v63_n1_p1_Groshaus |
| Aporte de: |
Ejemplares similares
-
Biclique graphs and biclique matrices
Publicado: (2010) -
Biclique-Helly graphs
por: Groshaus, M., et al. -
On the iterated biclique operator
por: Groshaus, M., et al. -
The number of convergent graphs under the biclique operator with no twin vertices is finite
por: Groshaus, M.E., et al. -
Biclique-Helly graphs
por: Groshaus, Marina E.
Publicado: (2007)