Graphlets | Features | Importance of edge e |
---|---|---|
\(T_1\)-Graph | \(|N(u) \cap N(v)| = 0\), and there may only exist an edge between two vertices belonging to N(w), where \(w \in \{u, v\}\). | Weak |
\(T_2\)-Graph | \(|N(u) \cap N(v)| \le 2\), and u, v, and there does not exist an edge between two vertices belonging to \(N(u) \cap N(v)\). | Weak |
\(T_3\)-Graph | \(|N(u) \cap N(v)| = 1\), and there is an edge incident on w1 and w2, where \(w_1 \in N(u) \cap N(v)\), \(w_2 \in (N(u) \cup N(v) - (N(u) \cap N(v))\). | Medium |
\(T_4\)-Graph | \(|N(u) \cap N(v)| \ge 2\), and \({u, v, w_1, w_2}\) induces a clique. | Strong |