[Top][All Lists]

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

Re: [igraph] motifs of size 4 tassonomy

From: Tamas Nepusz
Subject: Re: [igraph] motifs of size 4 tassonomy
Date: Mon, 24 Jan 2011 15:30:44 +0100
User-agent: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv: Gecko/20101208 Lightning/1.0b2 Thunderbird/3.1.7

Hi Simone,

You're right, this is not documented properly. Item i in the result
counts the number of motifs isomorphic to the graph with 4 vertices and
isomorphy class i. There are 11 possible non-isomorphic undirected
graphs of size 4, and these can be plotted as follows:

for i in xrange(11):
    plot(Graph.Isoclass(4, i), "isoclass_%d.pdf" % i, bbox=(100, 100),

This snippet gives you 11 PDF files that show each of the isomorphy classes.


On 01/24/2011 03:24 PM, Simone Gabbriellini wrote:
> Hello List,
> I would like to calculate a value of transitivity for an *undirected* 
> bipartite graph. I have to find the number of quadruplets of nodes with four 
> links and  the number of quadruplets of nodes with at least three. I use 
> motifs to extract the quadruplets census:
> (Python)
> trans = g.motifs_randesu(size=4)
> but I cannot figure out the right classification for the census list. I guess 
> the first value is the number of quadruplets with no links, but how exactly 
> this classification goes on?
> thanks for any help!
> Best regards,
> Simone
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

reply via email to

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