DocumentCode
1572986
Title
On clustering coefficients of graphs with the fixed numbers of vertices and edges
Author
Takahashi, Norikazu
Author_Institution
Dept. of Inf., Kyushu Univ., Fukuoka, Japan
fYear
2009
Firstpage
814
Lastpage
817
Abstract
The problem of finding the minimum and maximum values of the clustering coefficients of graphs with the fixed numbers of vertices and edges is considered. It is shown that when a graph has n vertices and the average degree is n/2 the clustering coefficient can take values from 0 to 1 - 1/2(n - 1).
Keywords
computational geometry; graph theory; graph clustering coefficient; maximum value; minimum value; Clustering algorithms; Complex networks; Informatics; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuit Theory and Design, 2009. ECCTD 2009. European Conference on
Conference_Location
Antalya
Print_ISBN
978-1-4244-3896-9
Electronic_ISBN
978-1-4244-3896-9
Type
conf
DOI
10.1109/ECCTD.2009.5275108
Filename
5275108
Link To Document