[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] about triangle transitivity

From: Gábor Csárdi
Subject: Re: [igraph] about triangle transitivity
Date: Thu, 12 Jan 2012 09:00:32 -0500


graph.motifs() (in R) supports motifs of size 3 and 4 currently. There
is not much more code needed to support larger motifs, but these are
not implemented yet.

If you are looking for a specific motif, then you can also use the
graph.count.subisomorphisms.vf2() function.


On Thu, Jan 12, 2012 at 4:53 AM, gunce orman <address@hidden> wrote:
> Hello,
> Transitivity only measures the number of triangles in a network.  But there
> are other short cycles (e.g., 4-cycles) which are common in networks. Are we
> able to calculate those types of 4- and more cycles as well as counting
> triangles in igraph.
> Thank you
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

Gabor Csardi <address@hidden>     MTA KFKI RMKI

reply via email to

[Prev in Thread] Current Thread [Next in Thread]