The number of convergent graphs under the biclique operator with no twin vertices is finite

@article{Groshaus2009TheNO,
  title={The number of convergent graphs under the biclique operator with no twin vertices is finite},
  author={Marina Groshaus and Leandro Montero},
  journal={Electron. Notes Discret. Math.},
  year={2009},
  volume={35},
  pages={241-246}
}
On cliques and bicliques
Biclique graphs of interval bigraphs
ON THE CLIQUE BEHAVIOR OF GRAPHS WITH SMALL CONSTANT LINK
Given a finite simple graph G, we define K(G) as the intersection graph of the (maximal) cliques of G, and inductively we define Kn(G) as G if n = 0, and as K(Kn−1(G)) if n > 0. We say that a graph G
Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
TLDR
This paper shows that the class of hereditary biclique-Helly graphs is formed precisely by those C4-dominated graphs that contain no triangles and no induced cycles of length either 5 or 6, and develops an algorithm for recognizing hereditary bimodal graphs in O(n2+αm) time and O( n+m) space.
Termination of the iterated strong-factor operator on multipartite graphs
Biclique graphs of split graphs

References

SHOWING 1-10 OF 11 REFERENCES
The icosahedron is clique divergent
Clique Graph Recognition Is NP-Complete
TLDR
The clique graph recognition problem is NP-complete because there exists a graph H such that G=K(H) and there is no graph G such that H is a cliqueGraph.
A Characterization of Clique Graphs.
A partial characterization of clique graphs
Convergencia y divergencia del grafo biclique iterado
  • Master’s thesis, Departamento de Computación. Facultad de Ciencias Exactas y Naturales. Universidad de Buenos Aires. (2008).
  • 2008
Clique divergence in graphs, in: Algebraic methods in graph theory, Vol. I, II (Szeged
  • Colloq. Math. Soc. János Bolyai
  • 1978
...
...