Cube-Connected Complete Graphs
Juan Liu, Xindong Zhang · 2014
The n-dimensional cube-connected complete graph, denoted by CCCP (n), is constructed from the n-dimensional hypercube Qn by replacing each vertex of Qn with a complete graph of order n. In this paper, we prove that CCCP (n) is Cayley graph, and study the basic properties of CCCP (n), including spectra, connectivity, Hamiltonian, diameter etc.