# signed graphs

Can signed graphs be handled by sage ?

signed graphs

Can signed graphs be handled by sage ?

add a comment

0

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...

0

Asked: **
2011-10-31 14:42:11 -0600
**

Seen: **227 times**

Last updated: **Oct 31 '11**

Plotting a frequency chart from a set of values

How to slice an unknown length iterator

how to set latex options on graph to make them ultra small ?

Discrepancy between Graph.modular_decomposition() and Wikipedia

Using nauty_geng with variable number of vertices

How to get an arbitrary orientation of a graph.

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.