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).
| Original language | English |
|---|---|
| Title of host publication | ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program |
| Pages | 814-817 |
| Number of pages | 4 |
| DOIs | |
| Publication status | Published - Dec 10 2009 |
| Externally published | Yes |
| Event | ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program - Antalya, Turkey Duration: Aug 23 2009 → Aug 27 2009 |
Publication series
| Name | ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program |
|---|
Other
| Other | ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program |
|---|---|
| Country | Turkey |
| City | Antalya |
| Period | 8/23/09 → 8/27/09 |
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering
Cite this
Takahashi, N. (2009). On clustering coefficients of graphs with the fixed numbers of vertices and edges. In ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program (pp. 814-817). [5275108] (ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program). https://doi.org/10.1109/ECCTD.2009.5275108