Table 1. Notation.

H = (V, E)	host graph within which we count the graphlets and orbits
n	number of nodes of H; n = |V|
e	number of H’s edges; e = |E|
d(v)	degree of node v
d	maximal node degree in H; d = maxv ∈ V d(v)
N(v)	set of neighbours of vertex v ∈ V
N(v1, v2, …, vj)	set of common neighbours of v1, v2, …, vj; N(v1, v2, …, vj) = N(v1)∩N(v2)∩…∩N(vj)
$N\left(\mathcal{S}\right)$	common neighbours of nodes in the set $\mathcal{S}\subset V$; $N\left(\mathcal{S}\right)={\cap }_{v\in \mathcal{S}}N\left(v\right)$
c(v), c(v1, v2, …, vj), $c\left(\mathcal{S}\right)$	number of common neighbours of vertex v, of vertices v1, v2, …, vj, and of vertices from set $\mathcal{S}$, respectively; that is, c(v) = |N(v)|, c(v1, v2, …, vj) = |N(v1, v2, …, vj)|, $c\left(\mathcal{S}\right)=\left|N\right(\mathcal{S}\left)\right|$
${\mathcal{G}}_k$	set of all graphlets with k nodes
Ga	graphlet a, according to some enumeration
Oi	orbit i, according to some enumeration
oi(v), oi	the number of times the node v appears in an induced subgraph in orbit i; since v will be obvious, we will use the shorter notation oi
m(i)	index of the graphlet containing the orbit Oi, e.g. m(16) = 9