On clustering coefficients of graphs with the fixed numbers of vertices and edges

Norikazu Takahashi

doi:10.1109/ECCTD.2009.5275108

On clustering coefficients of graphs with the fixed numbers of vertices and edges

Norikazu Takahashi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

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	https://doi.org/10.1109/ECCTD.2009.5275108
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

Access to Document

10.1109/ECCTD.2009.5275108

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 (ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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., 5275108, ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program, pp. 814-817, ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program, Antalya, Turkey, 8/23/09. https://doi.org/10.1109/ECCTD.2009.5275108

@inproceedings{535c98d7d00647f6b7b0cd9542221927,

title = "On clustering coefficients of graphs with the fixed numbers of vertices and edges",

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).",

author = "Norikazu Takahashi",

year = "2009",

month = dec,

day = "10",

doi = "10.1109/ECCTD.2009.5275108",

language = "English",

isbn = "9781424438969",

series = "ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program",

pages = "814--817",

booktitle = "ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program",

note = "ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program ; Conference date: 23-08-2009 Through 27-08-2009",

}

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 -

On clustering coefficients of graphs with the fixed numbers of vertices and edges

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this