I am interested in finding a program which can calculate and preferably also visualize various products of not huge graphs.More specifically, I work with labeled, directed multigraphs, and would like to be able to calculate and visualize especially the lexicographic product of such graphs.Further, as it more precisely is a close variant of the lexicographic product I am interested in, it would be preferable if modifying the predefined operation is possible.Specifically, I am interested in the following: where L(sG) constitute the set of labels on node s in graph G, and pre(tH) is one of two sets of labels for t in H, the product is one such that 1) the set of nodes is (s,t) such that pre(tH) is a subset of L(sG), 2) (s,t) and (s',t') are related in GxH as specified by the lexicographic product, and 3) the labels L(sGxH) are [those from L(sG) plus those from the second set of labels of t in H called post(t,H)] minus [those from L(sG) inconsistent with the new post(t,H)].I do not assume that the program in question has the specified operation pre-programmed, but it would be very nice if it was implementable with some tampering.Does any one know of a package that would allow this?
Is there software for graph product calculation and visualization?
graph theory;application of theory;software
I think that Sage is the right thing for this task.Example.sage: G = digraphs.Circuit(40)  sage: G = G.lexicographic_product(G)sage: G.show()Other graph products and algorithms are available as well.