Maximum clustering coefficient of graphs with given number of vertices and edges

• Koizuka Saki

  Department of Electrical Engineering and Computer Science, Kyushu University

• Takahashi Norikazu

  Department of Informatics, Kyushu University

抄録

The clustering coefficient is one of the most important quantities characterizing complex networks. It is often said that many networks in the real world have high clustering coefficients. However, properties of the clustering coefficient itself have not been discussed much in the literature. In this paper, some fundamental properties of the clustering coefficient are studied. First we try to find the maximum value of the clustering coefficient of graphs with the given number of vertices and edges. Next we present some classes of graphs such that each member maximizes the clustering coefficient among its neighbors having the same number of vertices and edges.

収録刊行物

• Nonlinear Theory and Its Applications, IEICE

  Nonlinear Theory and Its Applications, IEICE 2 (4), 443-457, 2011

  一般社団法人 電子情報通信学会

キーワード

• complex network
• clustering coefficient
• maximization
• local search

詳細情報

• CRID: 1390001205346240768
• NII論文ID: 130001225015
• DOI: 10.1587/nolta.2.443
• ISSN: 21854106
• Web Site: https://www.jstage.jst.go.jp/article/nolta/2/4/2_4_443/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可