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

DOI10.1016/j.endm.2009.11.040zbMath1268.05107OpenAlexW2019229686MaRDI QIDQ2840544

Marina Groshaus, Leandro Montero

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.040

zbMATH Keywords

clique graphbiclique graphbicliquedivergent graphsconvergent graphsiterated biclique operator

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items

On cliques and bicliques ⋮ Biclique graphs of interval bigraphs ⋮ On bicliques and the second clique graph of suspensions ⋮ Diclique digraphs ⋮ Almost every graph is divergent under the biclique operator ⋮ On the termination of some biclique operators on multipartite graphs ⋮ Termination of the iterated strong-factor operator on multipartite graphs ⋮ Biclique graphs of split graphs

Cites Work

• Unnamed Item
• Equivariant collapses and the homotopy type of iterated clique graphs
• The clique operator on cographs and serial graphs
• Dismantlings and iterated clique graphs
• Whitney triangulations, local girth and iterated clique graphs
• The icosahedron is clique divergent
• A characterization of clique graphs
• Clique Graph Recognition Is NP-Complete
• On the Iterated Biclique Operator
• Biclique graphs and biclique matrices
• A partial characterization of clique graphs

This page was built for publication: The number of convergent graphs under the biclique operator with no twin vertices is finite