New classes of clustering coefficient locally maximizing graphs

DOI10.1016/J.DAM.2013.09.013zbMath1300.05152OpenAlexW2099808872MaRDI QIDQ741739

Norikazu Takahashi, Tatsuya Fukami

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)

Related Items (4)

Connectedness of graphs and its application to connected matroids through covering-based rough sets ⋮ Large values of the clustering coefficient ⋮ Connectedness of Graph and Matroid by Covering-Based Rough Sets ⋮ Graphs that locally maximize clustering coefficient in the space of graphs with a fixed degree sequence

Cites Work

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

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