2011年
Maximum Clustering Coefficient of Graphs with Given Number of Vertices and Edges
Nonlinear Theory and Its Applications, IEICE
- ,
- 巻
- 2
- 号
- 4
- 開始ページ
- 443
- 終了ページ
- 457
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1587/nolta.2.443
- 出版者・発行元
- 一般社団法人 電子情報通信学会
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.
- リンク情報
- ID情報
-
- DOI : 10.1587/nolta.2.443
- ISSN : 2185-4106
- CiNii Articles ID : 130001225015