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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationECCTD 2009 - European Conference on Circuit Theory and Design Conference Program
Pages814-817
Number of pages4
DOIs
Publication statusPublished - 2009
Externally publishedYes
EventECCTD 2009 - European Conference on Circuit Theory and Design Conference Program - Antalya, Turkey
Duration: Aug 23 2009Aug 27 2009

Other

OtherECCTD 2009 - European Conference on Circuit Theory and Design Conference Program
CountryTurkey
CityAntalya
Period8/23/098/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] https://doi.org/10.1109/ECCTD.2009.5275108

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 proceedingConference 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, 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
Takahashi N. 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. 2009. p. 814-817. 5275108 https://doi.org/10.1109/ECCTD.2009.5275108
Takahashi, Norikazu. / On clustering coefficients of graphs with the fixed numbers of vertices and edges. ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program. 2009. pp. 814-817
@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",
doi = "10.1109/ECCTD.2009.5275108",
language = "English",
isbn = "9781424438969",
pages = "814--817",
booktitle = "ECCTD 2009 - European Conference on Circuit Theory and Design Conference Program",

}

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 -