Clique structure and other network properties of the tensor product of Erdos-Rényi graphs

We analyze the number of cliques of given size and the size of the largest clique in tensor product G x H of two Erdos-R & eacute;nyi graphs G and H. Then an extended clustering coefficient is introduced and is studied for G x H. Restriction to the standard clustering coefficient has a direct relation to the local efficiency of the graph, and the results are also interpreted in terms of the efficiency. As a last statistic of interest, the number of isolated vertices is analyzed for G x H.