Structural properties of biclique graphs and the distance formula

Marina Groshaus, Leandro Montero

A \textit{biclique} is a maximal induced complete bipartite subgraph of $G$. The \textit{biclique graph} of a graph $G$, denoted by $KB(G)$, is the intersection graph of the family…