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

DOI10.1016/J.DAM.2016.10.002MaRDI QIDQ516886zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

complex networkclustering coefficient2-switch

Mathematics Subject Classification ID

Vertex degrees (05C07)

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

Cites work

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

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)