1 paper
Xiwu Yang, Xiaodong Cheng, Yuansheng Yang
Let H, T and Cn be a graph, a tree and a cycle of order n, respectively. Let H(i) be the complete join of H and an empty graph on i vertices. Then the Cartesian p…