@article {
author = {Touli, Elena and Lindberg, Oscar},
title = {Relative Clustering Coefficient},
journal = {Journal of Algorithms and Computation},
volume = {54},
number = {1},
pages = {99-108},
year = {2022},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2022.88373},
abstract = {In this paper, we relatively extend the definition of the global clustering coefficient to another clustering, which we call it \emph{relative clustering coefficient}. The idea of this definition is to ignore the edges in the network that the probability of having an edge is $0$. Here, we also consider a model as an example that using the relative clustering coefficient is better than the global clustering coefficient for comparing networks and also checking the properties of the networks.},
keywords = {The global clustering coefficient,local clustering coefficient,relative clustering coefficient,Networks,and graphs},
url = {https://jac.ut.ac.ir/article_88373.html},
eprint = {https://jac.ut.ac.ir/article_88373_3d678c3dff380dbd41d09aa352638319.pdf}
}