Maximum clustering coefficient of graphs with given number of vertices and edges
スポンサーリンク
概要
- 論文の詳細を見る
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.
著者
-
Takahashi Norikazu
Department Of Computer Science And Communication Engineering Faculty Of Engineering Kyushu Universit
-
Koizuka Saki
Department of Electrical Engineering and Computer Science, Kyushu University
関連論文
- An Efficient Method for Simplifying Decision Functions of Support Vector Machines(Control, Neural Networks and Learning,Nonlinear Theory and its Applications)
- A Method for Solving Optimization Problems with Equality Constraints by Using the SPICE Program(Optimization and Control)(Nonlinear Theory and its Applications)
- Realization of Equilibrium Points by Means of a Completely Symmetrical Nonlinear Circuit
- Necessary and Sufficient Conditions for One-Dimensional Discrete-Time Autonomous Binary Cellular Neural Networks to Be Stable(Nonlinear Problems)
- Necessary and Sufficient Conditions for a 1-D DBCNN with an Input to Be Stable in terms of Connection Coefficients(Control, Neural Networks and Learning,Nonlinear Theory and its Applications)
- Necessary and Sufficient Conditions for 2-Dimensional Discrete-Time Systems Described by the Signum Function to be Stable(Papers Selected from 2003 International Technical Conference on Circuits/Systems, Computers and Communications(ITC-C
- Maximum clustering coefficient of graphs with given number of vertices and edges