Almost every graph is divergent under the biclique operator

@article{Groshaus2016AlmostEG,
  title={Almost every graph is divergent under the biclique operator},
  author={Marina Groshaus and Andr{\'e} Luiz Pires Guedes and Leandro Montero},
  journal={Discrete Applied Mathematics},
  year={2016},
  volume={201},
  pages={130-140}
}

• Marina Groshaus, André Luiz Pires Guedes, Leandro Montero
• Published 2016 in Discrete Applied Mathematics
• DOI:10.1016/j.dam.2015.07.022

A biclique of a graph G is a maximal induced complete bipartite subgraph of G. The biclique graph of G denoted by KB(G), is the intersection graph of all the bicliques of G. The biclique graph can be thought as an operator between the class of all graphs. The iterated biclique graph of G denoted by KBk(G), is the graph obtained by applying the biclique operator k successive times to G. The associated problem is deciding whether an input graph converges, diverges or is periodic under the… CONTINUE READING

Save

Watch Paper

Cite

View on ArXiv