PMC:4561322 / 13098-13542 JSONTXT

{"target":"http://pubannotation.org/docs/sourcedb/PMC/sourceid/4561322","sourcedb":"PMC","sourceid":"4561322","source_url":"https://www.ncbi.nlm.nih.gov/pmc/4561322","text":"In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. As shown in Figures 1(c) and 1(d), compared with random network whose numbers of nodes and edges are the same as PIN of QSYQ, the clustering coefficient of PIN was higher. It meant the PIN of QSYQ was more modular. These results suggested that the network exhibited the properties of scale-free, small word, and modularity.","tracks":[]}