Clique structure and other network properties of the tensor product of Erdős–Rényi graphs

Date

2025-06-01

Author

Işlak, Ümit
İncekara, Buğra

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

81
views

0
downloads

Cite This

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.

Subject Keywords

clique, clustering coefficient, Erdős–Rényi graph, graph product, Random graph

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=105017900618&origin=inward
https://hdl.handle.net/11511/116319

Collections

Graduate School of Applied Mathematics, Article