The number of convergent graphs under the biclique operator with no twin vertices is finite
The biclique graph of G, K B (G), is the intersection graph of the bicliques of G. Given a graph G, the iterated biclique graph of G, K B k (G), is the graph defined iteratively as follows: K B k + 1 (G) = K B (K B k (G)). Say that a graph G diverges (resp. converges) under the operator KB whenever...
Guardado en:
| Autores principales: | Groshaus, Marina E., Montero, Leandro P. |
|---|---|
| Publicado: |
2009
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v35_nC_p241_Groshaus http://hdl.handle.net/20.500.12110/paper_15710653_v35_nC_p241_Groshaus |
| Aporte de: |
Ejemplares similares
-
The number of convergent graphs under the biclique operator with no twin vertices is finite
por: Groshaus, M.E., et al. -
On the iterated biclique operator
por: Groshaus, M., et al. -
On the iterated biclique operator
Publicado: (2013) -
Biclique graphs and biclique matrices
por: Groshaus, M., et al. -
Biclique graphs and biclique matrices
Publicado: (2010)