Volume :8 , Issue :3 ,Page :156-175

Abstract :A clique in a graph G is a comple te subgraph of G. A clique partition of G is a collection C of cliques such that each edge of G occurs in exactly on e clique in C. The clique partition number cp(G) is the minimum size of a clique partition of G. In this paper upper bounds for th e clique partition number of the Boolean function graphs 2 BF (G) and BF 3 (G) for some standard graphs are obtained.