Can signed graphs be handled by sage ?
You can assign weights or labels to edges, so you can have signs that way. I don't know of specific support for signed graphs beyond that. You're welcome to extend things with functions for signed graphs, though!
What do you mean by handled? You can make a graph with edge weights in 1,-1:
sage: m = random_matrix(QQ, 5,5, num_bound=1, den_bound=1,density=0.75)
sage: m
[-1 0 0 1 1]
[ 1 0 0 1 0]
[ 0 0 0 1 -1]
[ 0 1 0 1 1]
[ 1 0 1 0 0]
sage: G = Graph(m,format='weighted_adjacency_matrix')
sage: G
Looped graph on 5 vertices
sage: G.edges()
[(0, 0, -1), (0, 3, 1), (0, 4, 1), (1, 3, 1), (2, 3, 1), (2, 4, -1), (3, 3, 1), (3, 4, 1)]
sage: G.weighted()
True
sage: G.incidence_matrix()
[-1 -1 0 0 0 0 0 1]
[ 0 0 -1 0 0 0 0 0]
[ 0 0 0 -1 -1 0 0 0]
[ 0 1 1 0 1 -1 1 0]
[ 1 0 0 1 0 1 0 0]Though according to http://en.wikipedia.org/wiki/Signed_graph#Other_kinds_of_.22signed_graph.22, these are not quite the same thing because of the additional multiplicative structure...
Ah, I see. It wouldn't be too hard to subclass a graph to add the signed graph-specific functionality, ISTM.
Of course.
Asked: 13 years ago
Seen: 591 times
Last updated: Oct 31 '11
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
