Skip to main content


Fig. 5 | Applied Network Science

Fig. 5

From: A survey on graph kernels

Fig. 5

Graphlets. Illustration of graphlets on 3 vertices in a graph G. Each circle represents a vertex and each line connecting two circles an edge. A 3-graphlet is an instance of an edge pattern on the induced subgraph of 3 vertices. We highlight examples of empty (right), single-edge (top-left), and double-edge (bottom-left) 3-graphlets. No complete graphlets are present in the graph. The graphlet kernel is computed by comparing the number of instances of each pattern in two graphs

Back to article page