Graphs that locally maximize clustering coefficient in the space of graphs with a fixed degree sequence

DOI10.1016/J.DAM.2016.10.002zbMATH Open1358.05069OpenAlexW2532936822MaRDI QIDQ516886FDOQ516886

Authors: Tatsuya Fukami, Norikazu Takahashi 

Publication date: 15 March 2017

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

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

Recommendations

• New classes of clustering coefficient locally maximizing graphs
• Large values of the clustering coefficient
• Degree and clustering coefficient in sparse random intersection graphs
• The clustering coefficient of a scale-free random graph
• Local clustering coefficients in preferential attachment models

zbMATH Keywords

complex networkclustering coefficient2-switch

Mathematics Subject Classification ID

Vertex degrees (05C07)

Cites Work

• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Collective dynamics of `small-world' networks
• New classes of clustering coefficient locally maximizing graphs

Cited In (2)

• Large values of the clustering coefficient
• New classes of clustering coefficient locally maximizing graphs

This page was built for publication: Graphs that locally maximize clustering coefficient in the space of graphs with a fixed degree sequence

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