On replete graphs

A graph G is k-clique replete if G has clique number k and every elementary homomorphism of G has clique number greater than k. Results on the order of k-clique replete graphs are presented, and bounds for the minimum degree and the maximum degree of such graphs are discussed.