Analyzing the cliques in scale-free random graphs

MaRDI QIDQ3166134zbMATH OpenFDO

Authors Yilun Shang

Publication date 21 October 2012

zbMATH Keywords

scale-free random graphscliques in random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Asymptotics for cliques in scale-free random graphs
• Number of cliques in random scale-free network ensembles
• Counting cliques and cycles in scale-free inhomogeneous random graphs
• Large cliques in a power-law random graph
• Degree sequence of a scale-free random graph

Cited in

(12)

• About clique number estimates and exact enumeration in scale-free networks
• Scale Free Interval Graphs
• A new model for a scale-free hierarchical structure of isolated cliques
• A new model for a scale-free hierarchical structure of isolated cliques
• Counting cliques and cycles in scale-free inhomogeneous random graphs
• Non-searchability of random scale-free graphs
• Scale free interval graphs
• Cliques in rank-1 random graphs: the role of inhomogeneity
• Parameterized Clique on Scale-Free Networks
• Number of cliques in random scale-free network ensembles
• The frustum network model based on clique extension
• Asymptotics for cliques in scale-free random graphs

This page was built for publication: Analyzing the cliques in scale-free random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166134)