|Subject:||Re: [igraph] Maximum Common Subgraph|
|Date:||Fri, 11 Mar 2011 16:58:37 +0100|
|User-agent:||Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:22.214.171.124) Gecko/20110223 Lightning/1.0b2 Thunderbird/3.1.8|
Well, I don't expect to find it; the mapping [1, 0] would mean that vertex 0 of the second graph maps to vertex 1 of the first graph and vertex 1 of the second graph maps to vertex 0 of the first graph. Considering that graphs g and g2 have only one vertex in common (that has the same name, i.e. "B"), I wouldn't expect any subisomorphisms between the two graphs.
|[Prev in Thread]||Current Thread||[Next in Thread]|