Biclique Cover of Complete Graph and Honeycomb Network
Jasintha Quadras · 2011
A biclique of a simple graph G is a complete bipartite subgraph of G. A biclique cover of a graph G is a family of complete bipartite graphs (or bicliques ) such that every edge of the graph G belongs to at least one of these subgraphs. The minimum biclique cover of G is a collection of minimum number of bicliques which covers E(G). We represent ܭ in a ڿ logଶ ۀ - dimensional hypercube in ڿ ୪୭ మ ۀ space and we prove that the cardinality of minimum biclique cover of complete graph ܭ is ڿ logଶ ۀ . We have proved that the cardinality of minimum biclique cover of honeycomb network HC(n) is 3 ଶ .