TY - GEN
T1 - On clustering coefficients of graphs with the fixed numbers of vertices and edges
AU - Takahashi, Norikazu
PY - 2009/12/10
Y1 - 2009/12/10
N2 - 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).
AB - 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).
UR - http://www.scopus.com/inward/record.url?scp=71249103850&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=71249103850&partnerID=8YFLogxK
U2 - 10.1109/ECCTD.2009.5275108
DO - 10.1109/ECCTD.2009.5275108
M3 - Conference contribution
AN - SCOPUS:71249103850
SN - 9781424438969
T3 - ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program
SP - 814
EP - 817
BT - ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program
T2 - ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program
Y2 - 23 August 2009 through 27 August 2009
ER -