New classes of clustering coefficient locally maximizing graphs

DOI10.1016/J.DAM.2013.09.013MaRDI QIDQ741739zbMATH OpenOpenAlexFDO

Authors Tatsuya Fukami, Norikazu Takahashi

Publication date 12 September 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.09.013

zbMATH Keywords

complex networkclustering coefficientconnected caveman graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Recommendations

• Graphs that locally maximize clustering coefficient in the space of graphs with a fixed degree sequence
• Large values of the clustering coefficient
• Global cycle properties in graphs with large minimum clustering coefficient
• Regularity lemmas for clustering graphs
• The clustering coefficient of a scale-free random graph

Cites work

• Collective dynamics of `small-world' networks
• Emergence of Scaling in Random Networks
• Renormalization group analysis of the small-world network model
• The Structure and Function of Complex Networks
• The clustering coefficient of a scale-free random graph

Cited in

(6)

• Large values of the clustering coefficient
• Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
• Connectedness of graph and matroid by covering-based rough sets
• A Local Clustering Algorithm for Connection Graphs
• Connectedness of graphs and its application to connected matroids through covering-based rough sets
• Graphs that locally maximize clustering coefficient in the space of graphs with a fixed degree sequence

This page was built for publication: New classes of clustering coefficient locally maximizing graphs

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