Almost every graph is divergent under the biclique operator

DOI10.1016/j.dam.2015.07.022zbMath1329.05280arXiv1408.6063OpenAlexW1582366387MaRDI QIDQ908300

Marina Groshaus, Leandro Montero, André L. P. Guedes

Publication date: 4 February 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.6063

zbMATH Keywords

bicliquesfalse-twin-free graphsgraph dynamicsbiclique graphsiterated graph operators

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

On the iterated edge-biclique operator ⋮ Biclique graph of bipartite permutation graphs ⋮ On cliques and bicliques ⋮ Biclique graphs of interval bigraphs ⋮ On bicliques and the second clique graph of suspensions ⋮ Clique‐convergence is undecidable for automatic graphs ⋮ On the edge‐biclique graph and the iterated edge‐biclique operator ⋮ Intersection graph of maximal stars ⋮ Diclique digraphs ⋮ Biclique graphs of split graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Generating bicliques of a graph in lexicographic order
• Clique graphs and Helly graphs
• Equivariant collapses and the homotopy type of iterated clique graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Clique divergent graphs with unbounded sequence of diameters
• A family of clique divergent graphs with linear growth
• The clique operator on cographs and serial graphs
• Dismantlings and iterated clique graphs
• Whitney triangulations, local girth and iterated clique graphs
• Bicliques and eigenvalues
• The icosahedron is clique divergent
• Locally \(C_6\) graphs are clique divergent
• Incidence matrices and interval graphs
• The clique operator on graphs with few \(P_{4}\)'s
• A characterization of clique graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Über iterierte Clique-Graphen
• Point determination in graphs
• The number of convergent graphs under the biclique operator with no twin vertices is finite
• Clique Graph Recognition Is NP-Complete
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• On the Iterated Biclique Operator
• Biclique graphs and biclique matrices
• Algorithm Theory - SWAT 2004
• A partial characterization of clique graphs
• Sur deux propriétés des classes d'ensembles
• On the generation of bicliques of a graph
• Bicliques in graphs. I: Bounds on their number

This page was built for publication: Almost every graph is divergent under the biclique operator