This article is cited in 1 paper

On biclique covering number of the Cartesian product of graphs

V. V. Lepin, O. I. Duginov

Institute of Mathematics of the National Academy of Sciences of Belarus

Abstract: The paper is dealt with the biclique cover number (i.e. minimal number of complete bipartite subgraphs of a graph needed to cover the edge set of the graph) of the Cartesian product of two graphs. It is obtained upper bounds on the biclique cover number for the Cartesian product of graphs. It is given the formula for exact value of the biclique cover number for the Cartesian product of $P_n$ and $K_2$, $C_n$ and $K_2$, $P_n$ and $P_n$.

UDC: 519.1

Received: 10.01.2013