| igraph Reference Manual |
|---|
This section deals with functions which find small induced subgraphs in a graph. These were first defined for subgraphs of two and three vertices by Holland and Leinhardt, and named dyad census and triad census.
<< 4.4. igraph_isoclass_create — Creates a graph from the given isomorphism class. |
1. igraph_dyad_census — Calculating the dyad census as defined by Holland and Leinhardt >> |