Graph characteristics of cortical thickness networks.
收藏NIAID Data Ecosystem2026-03-07 收录
数据链接：
官方服务：
资源简介：
Properties of the full network, plus each principal network containing more than one vertex, are given. The most connected vertex in each case is based on the sum of absolute weights of edges connected to the vertices, ignoring self-connections. Efficiency measures are calculated following Latora & Marchiori [41]. Unweighted versions of all measured are used, where the option exists.
创建时间：
2013-04-22
