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 H, denoted by KB(H), is the intersection graph of the family of all bicliques of H. In this work we address the following question: Given a biclique graph G=KB(H), is it possible to remove a vertex q of G, such that Gq is a biclique graph? And if possible, can we obtain a graph H such that Gq=KB(H)? We show that the general question has a "no" for answer. However, we prove that if G has a vertex q such that d(q)=2, then Gq is a biclique graph and we show how to obtain H.





Describes a project that uses

Uses Software






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)