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 - 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 |
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
On clustering coefficients of graphs with the fixed numbers of vertices and edges. / Takahashi, Norikazu.
ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program. 2009. p. 814-817 5275108.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - On clustering coefficients of graphs with the fixed numbers of vertices and edges
AU - Takahashi, Norikazu
PY - 2009
Y1 - 2009
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
SN - 9781424438969
SP - 814
EP - 817
BT - ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program
ER -