 Another construction of is the Cartesian product of two-vertex complete graphs .More generally the Cartesian product of copies of a complete graph is called a Hamming graph; the hypercube graphs are examples of Hamming graphs.The graph consists of a single vertex, while is the complete graph on two vertices and is a cycle of length .