We introduce a new node centrality measure, graphlet degree centrality (GDC), which measures the density of the node's extended network neighborhood. Hence, nodes that reside in dense extended network neighborhoods will have higher GDCs than nodes that reside in sparse extended network neighborhoods. In particular, we define GDC as follows. For a node v, we denote by v i the i th coordinate of its GDV, i.e., v i is the number of times node v touches an orbit i. Then, GDC of node v is computed as follows: 