Skip to main content
Figure 2 | BMC Evolutionary Biology

Figure 2

From: Evolutionary cores of domain co-occurrence networks

Figure 2

Cores of the domain co-occurrence networks. The k-core of a graph is defined as the largest subgraph where every node has at least k links. For each choice of k, we determine the k-cores by iteratively pruning all nodes with degree lower than k and their incident links. In the schematic representation, the 1-core consists of all the nodes while the 3-core only contains the nodes on orange background. Panels a-e show the 2 innermost k-cores (red: 1-core and yellow: 2-core) of the domain networks mapped for the proteomes of (a) S. cerevisiae, (b) C. elegans, (c) D. melanogaster, (d) M. musculus and (e) H. sapiens. (f) Local vs. global centrality. Interpreted as its importance a node is related to its degree and network neighborhood. A hub that is only a member of the outer k-cores is defined as locally central (top-left), while nodes (not necessarily the biggest hubs) being-members of the innermost cores are globally central (top-right).

Back to article page