> Indeed, if I create a BipartiteGraph object I would expect the
> is_isomorphic() function to check for isomorphism *as bipartite graphs*.
>
> (luckily, for connected graphs, the notions are the same)
if self.is_connected():
return Graph.is_isomorphic(self)
else:
raise ValueError("No idea on earth !")
I also wondered whether you wanted to compute isomorphisms in which the two
sets are exchanged :
edges = [(1,2), (2,3)]
BipartiteGraph( edges, partition = [[2], [1,3]
).is_isomorphic(BipartiteGraph( edges, partition = [[1,3], [2]] ))
?
Nathann
--
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
