2024/08/14 by Ümi̇t Işlak, Islak, Umit, Buğra İncekara +1
Chemistry · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Probability (math.PR) #Synthesis and Properties of Aromatic Compounds
paper · pdf · doi:10.48550/arxiv.2408.07627
openalex publication_date 2024/08/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We analyze the number of cliques of given size and the size of the largest clique in tensor product G × H of two Erdős-Rényi graphs G and H. Then an extended clustering coefficient is introduced and is studied for G × 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 × H. The paper is concluded with a discussion of the modular product of random graphs, and the relation to the maximum common subgraph problem.