count_motifs

graph.motifs.no

Graph motifs are small connected subgraphs with a well-defined
structure. These functions search a graph for various motifs.

Routines for simple graphs and network analysis. It can
handle large graphs very well and provides functions for generating random
and regular graphs, graph visualization, centrality methods and much more.

Tam<c3><a1>s Nepusz

igraph

Network Analysis and Visualization

count_motifs function

<dl><dt>graph</dt>
<dd>Graph object, the input graph.</dd>
<dt>size</dt>
<dd>The size of the motif.</dd>
<dt>cut.prob</dt>
<dd>Numeric vector giving the probabilities that the search
graph is cut at a certain level. Its length should be the same as the size
of the motif (the <code>size</code> argument). By default no cuts are made.</dd></dl>

Arguments

Graph motifs — count_motifs

<dl>

<dt>graph</dt>
<dd>Graph object, the input graph.</dd>


<dt>size</dt>
<dd>The size of the motif.</dd>


<dt>cut.prob</dt>
<dd>Numeric vector giving the probabilities that the search
graph is cut at a certain level. Its length should be the same as the size
of the motif (the <code>size</code> argument). By default no cuts are made.</dd>

</dl>

count_motifs: Graph motifs

Description

Usage

Value

Arguments

Details

See Also

Examples