Vertex removal in biclique graphs
From MaRDI portal
Publication:2091812
Abstract: A extit{biclique} is a maximal induced complete bipartite subgraph. The extit{biclique graph} of a graph , denoted by , is the intersection graph of the family of all bicliques of . In this work we address the following question: Given a biclique graph , is it possible to remove a vertex of , such that is a biclique graph? And if possible, can we obtain a graph such that ? We show that the general question has a "no" for answer. However, we prove that if has a vertex such that , then is a biclique graph and we show how to obtain .
Recommendations
Cites work
- A characterization of clique graphs
- A partial characterization of clique graphs
- Algorithm Theory - SWAT 2004
- Biclique graph of bipartite permutation graphs
- Biclique graphs and biclique matrices
- Biclique graphs of interval bigraphs
- On the iterated biclique operator
- Practical graph isomorphism. II.
- Structural properties of biclique graphs and the distance formula
- Sur deux propriétés des classes d'ensembles
- The complexity of clique graph recognition
Cited in
(7)- Biclique graphs of interval bigraphs
- scientific article; zbMATH DE number 5354839 (Why is no real title available?)
- Biclique graph of bipartite permutation graphs
- On some conjectures on biclique graphs
- Modifying a graph using vertex elimination
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- Structural properties of biclique graphs and the distance formula
This page was built for publication: Vertex removal in biclique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2091812)