# signed graphs

Can signed graphs be handled by sage ?

signed graphs

Can signed graphs be handled by sage ?

add a comment

0

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

Please start posting anonymously - your entry will be published after you log in or create a new account.

Asked: ** 2011-10-31 20:42:11 +0200 **

Seen: **283 times**

Last updated: **Oct 31 '11**

Enumerate isomrphic subgraphs of graph vertex labeled

Newton's cubic Fractal help. Plotting

Show function for graphs is not working!

Convert Sage's Graph to NetworkX graph

How to plot generic graphs without nodes overlapping

Changing the vertex shape for combinatorial graphs

Add graphs produced by a for loop?

Iterating over all non isomorphic connected graphs of given order

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.